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 - Xianfeng Ding, Meiling Hu:
A Branch-Reduction-Bound algorithm for linear fractional multi-product planning problems. 8 - Yuli Wang, Wenjuan Fan, Shaowen Lan, Shuwan Zhu, Jianmei Du:
An integrated operating room and physician scheduling problem solved by a hybrid variable neighborhood search-based algorithm. 9 - Songtao He, Erfang Shan, Yuxin Sun:
Mutually dependent, balanced contributions, and the priority value. 10 - S. Sureka Nithila Princy, Paulraj Ranjith Kumar:
Hybrid quantum-enhanced reinforcement learning for energy-efficient resource allocation in fog-edge computing. 11 - Tongli Zhang, Yong Xia:
Bivalent quadratic optimization with sum-of-square of quadratic penalties. 12 - Xiaowei Li, Xiwen Lu:
Strategy-proof mechanisms for maximizing social satisfaction in the facility location game. 13 - Duy Hieu Do, Thi Ha Duong Phan:
An improvement on the Louvain algorithm using random walks. 14
Volume 50, Number 2, September 2025
- Somnath Buriuly, Leena Vachhani, Arpita Sinha, Sivapragasam Ravitharan, Sunita Chauhan:
Moving horizon capacitated arc routing problem. 15 - Yuquan Lin, Wensong Lin:
Semistrong edge colorings of planar graphs. 16 - Dong Cheng, Huina Zhang, Yong Wu:
Maximum expert consensus models with both type-α and type-ε constraints. 17 - Siddharth Gaur, R. Inkulu:
A divide-and-conquer based preprocessing for routing in a simple polygon. 18 - Paul Immanuel, A. Berin Greeni:
Embedding crossed cube into diverse product graphs and tree-derived architectures. 19 - Wenzhu Yang, Zhanshan Li:
Graph Coloring problem solving using monte carlo tree search and deep reinforcement learning. 20 - Sultan Ahmad, Kinkar Chandra Das:
General Sombor index: a study of branching in trees and solution for maximal trees with prescribed maximum degree. 21 - Jonas Tollenaere, Tony Wauters:
Quaternion-based formulations for volume maximisation problems. 22
Volume 50, Number 3, October 2025
- Guantao Chen, Guangming Jing, Wenan Zang:
Proof of the Goldberg-Seymour conjecture on edge-colorings of multigraphs. 23 - Jing Zhang, Rubing Chen, Jinjiang Yuan, C. T. Ng, T. C. E. Cheng:
Bicriterion parallel-machine scheduling of equal-length jobs to minimize total tardiness and number of tardy jobs. 24 - C. Pabitha, K. Revathi, W. Gracy Theresa, Pornpimol Chawengsaksopark, Mithileysh Sathiyanarayanan:
EmoMAC: a bias-induced multimodal fusion model for emotional analysis with visualization analytics enabled through super affective computing in emails. 25 - Baoyu Liao, Mengyu Sun, Xiaoxi Zhu, Panos M. Pardalos:
Investigation of discriminatory government subsidies for fuel vehicles and new energy vehicles by considering trade-ins. 26 - Youcef Magnouche, Ali Ridha Mahjoub, Sébastien Martin:
The multi-terminal vertex separator problem: total dual integrality and polytope composition. 27 - Yves Crama, Sourour Elloumi, Amélie Lambert, Elisabeth Rodríguez-Heck:
Quadratization and convexification in polynomial binary optimization. 28 - Subhabrata Paul, Kamal Santra:
Transitivity in some graph-classes. 29 - Baoyu Liao, Wenting Wang:
Optimal intelligent investment strategy in competing supply chains of electric vehicle charging facilities. 30 - Yuncheng Luo:
Stochastic single-machine scheduling problems with both time-dependent deterioration and position-dependent learning effect. 31
Volume 50, Number 4, November 2025
- Yanqing Wu:
On injective edge coloring of sparse graphs with maximum degree 5. 32 - Tilmann Schwenzow, Annika Lehnert, Christoph Liebrecht, Jörg Franke, Sebastian Reitelshöfer:
A quantum genetic algorithm for a parallel machine scheduling problem. 33 - Zeling Xu, Li Liu, Feiyu Guo:
Hot potato or valuable opportunity: e-tailer's support for competitor logistics service. 34 - Zhaohui Wang, Qiao Cui, Bin Tan, Xiao Yang, Weibang Zhou, Xiangsheng Huang:
Reinforcement learning-guided adaptive large neighborhood search for vehicle routing problem with time windows. 35 - Dariusz Dereniowski, Janusz Dybizbanski, Przemyslaw Karpinski, Michal Zakrzewski, Pawel Zylinski:
Low-degree spanning trees of 2-edge-connected graphs in linear time. 36 - Salman Khodayifar, Mohammadreza Farjaie:
Distributionally robust joint chance-constrained approach for the stochastic survivable capacitated network design problem. 37 - Sheng-Jie Chen, Guang-Ming Li, Liang Chen, Caixia Kou, Yu-Hong Dai:
Valid inequalities for the β-edge disruptor problem. 38 - Sangram K. Jena, K. Subramani, Alvaro Velasquez:
Advancing discrete optimization: novel approaches with dataless neural networks. 39 - Nilanjana Karmakar, Arindam Biswas:
Face recognition using life-centroid distance between featured persistence diagrams. 40 - Waseem Akram, Sanjeev Saxena:
Dominance for enclosure problems. 41 - Giovanni Pantuso:
Solution of stochastic facility location problems with combinatorially many decision-dependent distributions. 42
Volume 50, Number 5, December 2025
- Maria Luíza L. da Cruz, Raquel S. F. Bravo, Rodolfo A. Oliveira, Uéverton S. Souza:
Near-bipartiteness on graphs having small dominating sets. 43 - M. A. Shalu, V. K. Kirubakaran:
Total domination and open packing in some subclasses of bipartite graphs. 44 - Levi Ribeiro de Abreu, Bruno A. Prata:
A comparative computational study for parallel-machine problems with sustainable manufacturing constraints. 45 - Baruch Mor, Gur Mosheiov, Dana Shapira:
Single machine lot scheduling with maintenance activity. 46 - Dekel Tsur:
Faster algorithms for 3-leaf power modification problems. 47
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 2026-09-02 00:58 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
