| Handling Separable Non-convexities Using Disjunctive Cuts
|
2020 |
D'Ambrosio, Claudia |
| Dynamic and Stochastic Rematching for Ridesharing Systems: Formulations and Reductions
|
2020 |
Homsi, Gabriel |
| The Distance Matching Problem
|
2020 |
Madarasi, Péter |
| Notes on Equitable Partitions into Matching Forests in Mixed Graphs and b-branchings in Digraphs
|
2020 |
Takazawa, Kenjiro |
| Quasi-Separable Dantzig-Wolfe Reformulations for Network Design
|
2020 |
Frangioni, Da Antonio |
| On Finding Shortest Paths in Arc-Dependent Networks
|
2020 |
Wojciechowski, P. |
| On the p-Median Polytope and the Directed Odd Cycle Inequalities
|
2020 |
Baiou, Mourad |
| On the Linear Relaxation of the s — t-cut Problem with Budget Constraints
|
2020 |
Aissi, Hassene |
| On the Multiple Steiner Traveling Salesman Problem with Order Constraints
|
2020 |
Taktak, Raouia |
| An Experimental Study of ILP Formulations for the Longest Induced Path Problem
|
2020 |
Bökler, Fritz |
| Arc-Flow Approach for Parallel Batch Processing Machine Scheduling with Non-identical Job Sizes
|
2020 |
Trindade, Renan Spencer |
| An Efficient Matheuristic for the Inventory Routing Problem
|
2020 |
Diniz, Pedro |
| Polyhedra Associated with Open Locating-Dominating and Locating Total-Dominating Sets in Graphs
|
2020 |
Argiroffo, Gabriela |
| Improving Proximity Bounds Using Sparsity
|
2020 |
Lee, Jon |
| Cut and Flow Formulations for the Balanced Connected k-Partition Problem
|
2020 |
Miyazawa, Flávio K. |
| Anchored Rescheduling Problems Under Generalized Precedence Constraints
|
2020 |
Bendotti, Pascale |
| Scheduling with Non-renewable Resources: Minimizing the Sum of Completion Times
|
2020 |
Bérczi, Kristof |
| Dynamic Programming Approach to the Generalized Minimum Manhattan Network Problem
|
2020 |
Masumura, Yuya |
| The Knapsack Problem with Forfeits .
|
2020 |
Cerulli, Raffaele |
| Solving a Real-World Multi-attribute VRP Using a Primal-Based Approach
|
2020 |
Messaoudi, Mayssoun |
Tag hinzufügen