Abstract is missing.
- Polyhedra Associated with Open Locating-Dominating and Locating Total-Dominating Sets in GraphsGabriela R. Argiroffo, Silvia M. Bianchi, Yanina Lucarini, Annegret Wagler. 3-14 [doi]
- On the p-Median Polytope and the Directed Odd Cycle InequalitiesMourad Baïou, Francisco Barahona. 15-26 [doi]
- On k-edge-connected Polyhedra: Box-TDIness in Series-Parallel GraphsMichele Barbato, Roland Grappe, Mathieu Lacroix, Emiliano Lancini. 27-41 [doi]
- A Polyhedral Study for the Buy-at-Bulk Facility Location ProblemChaghoub Soraya, Ibrahima Diarrassouba. 42-53 [doi]
- Cardinality Constrained Multilinear SetsRui Chen, Sanjeeb Dash, Oktay Günlük. 54-65 [doi]
- On the Multiple Steiner Traveling Salesman Problem with Order ConstraintsRaouia Taktak, Eduardo Uchoa. 66-77 [doi]
- On the Linear Relaxation of the s-t-cut Problem with Budget ConstraintsHassene Aissi, Ali Ridha Mahjoub. 81-88 [doi]
- An Experimental Study of ILP Formulations for the Longest Induced Path ProblemFritz Bökler, Markus Chimani, Mirko H. Wagner, Tilo Wiedera. 89-101 [doi]
- Handling Separable Non-convexities Using Disjunctive CutsClaudia D'Ambrosio, Jon Lee 0001, Daphne E. Skipper, Dimitri Thomopulos. 102-114 [doi]
- Improving Proximity Bounds Using SparsityJon Lee 0001, Joseph Paat, Ingo Stallknecht, Luze Xu. 115-127 [doi]
- Cut and Flow Formulations for the Balanced Connected k-Partition ProblemFlávio Keidi Miyazawa, Phablo F. S. Moura, Matheus J. Ota, Yoshiko Wakabayashi. 128-139 [doi]
- Polynomial Scheduling Algorithm for Parallel Applications on Hybrid PlatformsMassinissa Ait Aba, Lilia Zaourar, Alix Munier. 143-155 [doi]
- Anchored Rescheduling Problems Under Generalized Precedence ConstraintsPascale Bendotti, Philippe Chrétienne, Pierre Fouilhoux, Adèle Pass-Lanneau. 156-166 [doi]
- Scheduling with Non-renewable Resources: Minimizing the Sum of Completion TimesKristóf Bérczi, Tamás Király, Simon Omlor. 167-178 [doi]
- Arc-Flow Approach for Parallel Batch Processing Machine Scheduling with Non-identical Job SizesRenan Spencer Trindade, Olinto C. B. de Araújo, Marcia Fampa. 179-190 [doi]
- Dynamic and Stochastic Rematching for Ridesharing Systems: Formulations and ReductionsGabriel Homsi, Bernard Gendron, Sanjay Dominik Jena. 193-201 [doi]
- The Distance Matching ProblemPéter Madarasi. 202-213 [doi]
- Notes on Equitable Partitions into Matching Forests in Mixed Graphs and b-branchings in DigraphsKenjiro Takazawa. 214-224 [doi]
- Quasi-Separable Dantzig-Wolfe Reformulations for Network DesignAntonio Frangioni, Bernard Gendron, Enrico Gorgone. 227-236 [doi]
- Dynamic Programming Approach to the Generalized Minimum Manhattan Network ProblemYuya Masumura, Taihei Oki, Yutaro Yamaguchi 0001. 237-248 [doi]
- On Finding Shortest Paths in Arc-Dependent NetworksPiotr J. Wojciechowski, Matthew Williamson, K. Subramani. 249-260 [doi]
- The Knapsack Problem with ForfeitsRaffaele Cerulli, Ciriaco D'Ambrosio, Andrea Raiconi, Gaetano Vitale. 263-272 [doi]
- An Efficient Matheuristic for the Inventory Routing ProblemPedro Diniz, Rafael Martinelli, Marcus Poggi. 273-285 [doi]
- Solving a Real-World Multi-attribute VRP Using a Primal-Based ApproachMayssoun Messaoudi, Issmail El Hallaoui, Louis-Martin Rousseau, Adil Tahir. 286-296 [doi]