default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDISCO 2020: Montreal, QC, Canada
- Mourad Baïou
, Bernard Gendron, Oktay Günlük, Ali Ridha Mahjoub:
Combinatorial Optimization - 6th International Symposium, ISCO 2020, Montreal, QC, Canada, May 4-6, 2020, Revised Selected Papers. Lecture Notes in Computer Science 12176, Springer 2020, ISBN 978-3-030-53261-1
Polyhedral Combinatorics
- Gabriela R. Argiroffo, Silvia M. Bianchi, Yanina Lucarini, Annegret Wagler:
Polyhedra Associated with Open Locating-Dominating and Locating Total-Dominating Sets in Graphs. 3-14 - Mourad Baïou, Francisco Barahona:
On the p-Median Polytope and the Directed Odd Cycle Inequalities. 15-26 - Michele Barbato, Roland Grappe, Mathieu Lacroix, Emiliano Lancini:
On k-edge-connected Polyhedra: Box-TDIness in Series-Parallel Graphs. 27-41 - Chaghoub Soraya, Ibrahima Diarrassouba:
A Polyhedral Study for the Buy-at-Bulk Facility Location Problem. 42-53 - Rui Chen, Sanjeeb Dash, Oktay Günlük:
Cardinality Constrained Multilinear Sets. 54-65 - Raouia Taktak, Eduardo Uchoa:
On the Multiple Steiner Traveling Salesman Problem with Order Constraints. 66-77
Integer Programming
- Hassene Aissi, Ali Ridha Mahjoub:
On the Linear Relaxation of the s-t-cut Problem with Budget Constraints. 81-88 - Fritz Bökler, Markus Chimani, Mirko H. Wagner, Tilo Wiedera:
An Experimental Study of ILP Formulations for the Longest Induced Path Problem. 89-101 - Claudia D'Ambrosio, Jon Lee, Daphne E. Skipper, Dimitri Thomopulos:
Handling Separable Non-convexities Using Disjunctive Cuts. 102-114 - Jon Lee, Joseph Paat, Ingo Stallknecht, Luze Xu:
Improving Proximity Bounds Using Sparsity. 115-127 - Flávio Keidi Miyazawa, Phablo F. S. Moura, Matheus Jun Ota, Yoshiko Wakabayashi:
Cut and Flow Formulations for the Balanced Connected k-Partition Problem. 128-139
Scheduling
- Massinissa Ait Aba, Lilia Zaourar, Alix Munier:
Polynomial Scheduling Algorithm for Parallel Applications on Hybrid Platforms. 143-155 - Pascale Bendotti, Philippe Chrétienne, Pierre Fouilhoux, Adèle Pass-Lanneau:
Anchored Rescheduling Problems Under Generalized Precedence Constraints. 156-166 - Kristóf Bérczi, Tamás Király, Simon Omlor:
Scheduling with Non-renewable Resources: Minimizing the Sum of Completion Times. 167-178 - Renan Spencer Trindade, Olinto C. B. de Araújo, Marcia Fampa:
Arc-Flow Approach for Parallel Batch Processing Machine Scheduling with Non-identical Job Sizes. 179-190
Matching
- Gabriel Homsi, Bernard Gendron, Sanjay Dominik Jena:
Dynamic and Stochastic Rematching for Ridesharing Systems: Formulations and Reductions. 193-201 - Péter Madarasi:
The Distance Matching Problem. 202-213 - Kenjiro Takazawa:
Notes on Equitable Partitions into Matching Forests in Mixed Graphs and b-branchings in Digraphs. 214-224
Network Design
- Antonio Frangioni, Bernard Gendron, Enrico Gorgone:
Quasi-Separable Dantzig-Wolfe Reformulations for Network Design. 227-236 - Yuya Masumura, Taihei Oki, Yutaro Yamaguchi:
Dynamic Programming Approach to the Generalized Minimum Manhattan Network Problem. 237-248 - Piotr Wojciechowski, Matthew D. Williamson, K. Subramani:
On Finding Shortest Paths in Arc-Dependent Networks. 249-260
Heuristics
- Raffaele Cerulli, Ciriaco D'Ambrosio, Andrea Raiconi, Gaetano Vitale:
The Knapsack Problem with Forfeits. 263-272 - Pedro Diniz, Rafael Martinelli, Marcus Poggi:
An Efficient Matheuristic for the Inventory Routing Problem. 273-285 - Mayssoun Messaoudi, Issmail El Hallaoui, Louis-Martin Rousseau, Adil Tahir:
Solving a Real-World Multi-attribute VRP Using a Primal-Based Approach. 286-296
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-03-11 19:49 CET 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:
翻译：