default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Optimization, Volume 50
Volume 50, Number 1, August 2025
- Feifeng Zheng, Na Li, Ming Liu
, Yinfeng Xu:
Single machine lot scheduling to minimize maximum weighted completion time. 1 - Aurélien Mombelli, Alain Quilliot:
Synchronizing production planning and job scheduling: MILP models and exact algorithms. 2 - Yusuke Kashiwagi, Masaki Yamamoto, Takamasa Yashima:
On the initial transition of graphs of Kirkman schedules by the partial team swap. 3 - Junran Yu, Jing Hu, Jiaquan Gao, Donglei Du, Xiaoyan Zhang:
Algorithms for 2-balanced connected k-partition problem in graphs. 4 - Bin Deng, Weidong Li:
Approximate maximin share allocation for indivisible goods under a knapsack constraint. 5 - Bo Chen, Alexander S. Kulikov, Silvano Martello:
New Challenges in Combinatorial Optimization. 6 - Hengzhao Ma, Jianzhong Li:
Hardness and algorithms for several new optimization problems on the weighted massively parallel computation model. 7
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-08-28 00:56 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
