Abstract is missing.
- On the Finite Optimal Convergence of Logic-Based Benders' Decomposition in Solving 0-1 Min-Max Regret Optimization Problems with Interval CostsLucas Assunção, Andréa Cynthia Santos, Thiago F. Noronha, Rafael Andrade. 1-12 [doi]
- A Full Description of Polytopes Related to the Index of the Lowest Nonzero Row of an Assignment MatrixWalid Ben-Ameur, Antoine Glorieux, José Neto. 13-25 [doi]
- On Robust Lot Sizing Problems with Storage Deterioration, with Applications to Heat and Power CogenerationStefano Coniglio, Arie Koster, Nils Spiekermann. 26-37 [doi]
- Reducing the Clique and Chromatic Number via Edge Contractions and Vertex DeletionsDaniël Paulusma, Christophe Picouleau, Bernard Ries. 38-49 [doi]
- The Parity Hamiltonian Cycle Problem in Directed GraphsHiroshi Nishiyama, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita. 50-58 [doi]
- Lovász-Schrijver PSD-Operator on Claw-Free GraphsSilvia Mianchi, Mariana S. Escalante, Graciela L. Nasini, Annegret Wagler. 59-70 [doi]
- Benders Decomposition for Capacitated Network DesignSara Mattia. 71-80 [doi]
- Modelling and Solving the Joint Order Batching and Picker Routing Problem in InventoriesCristiano Arbex Valle, John E. Beasley, Alexandre Salles da Cunha. 81-97 [doi]
- Uniqueness of Equilibria in Atomic Splittable Polymatroid Congestion GamesTobias Harks, Veerle Timmermans. 98-109 [doi]
- A Coordinate Ascent Method for Solving Semidefinite Relaxations of Non-convex Quadratic Integer ProgramsChristoph Buchheim, Maribel Montenegro, Angelika Wiegele. 110-122 [doi]
- MIP Formulations for a Rich Real-World Lot-Sizing Problem with Setup CarryoverFilippo Focacci, Fabio Furini, Virginie Gabrel, Daniel Godard, Xueying Shen. 123-134 [doi]
- Towards an Accurate Solution of Wireless Network Design ProblemsFabio D'Andreagiovanni, Ambros M. Gleixner. 135-147 [doi]
- Approximability and Exact Resolution of the Multidimensional Binary Vector Assignment ProblemMarin Bougeret, Guillerme Duvillié, Rodolphe Giroudeau. 148-159 [doi]
- Towards a Polynomial Equivalence Between k -Packing Functions and k-Limited Packings in GraphsValeria A. Leoni, Maria Patricia Dobson. 160-165 [doi]
- Exact Solution Methods for the k-Item Quadratic Knapsack ProblemLucas Létocart, Angelika Wiegele. 166-176 [doi]
- On Vertices and Facets of Combinatorial 2-Level PolytopesManuel Aprile, Alfonso Cevallos, Yuri Faenza. 177-188 [doi]
- Optimization Problems with Color-Induced Budget ConstraintsCorinna Gottschalk, Hendrik Lüthen, Britta Peis, Andreas Wierz. 189-200 [doi]
- Strengthening Chvátal-Gomory Cuts for the Stable Set ProblemAdam N. Letchford, Francesca Marzi, Fabrizio Rossi, Stefano Smriglio. 201-212 [doi]
- Scheduling Personnel Retraining: Column Generation HeuristicsOliver G. Czibula, Hanyu Gu, Yakov Zinder. 213-224 [doi]
- Diagonally Dominant Programming in Distance GeometryGustavo Dias, Leo Liberti. 225-236 [doi]
- A Decomposition Approach for Single Allocation Hub Location Problems with Multiple Capacity LevelsBorzou Rostami, Christopher Strothmann, Christoph Buchheim. 237-248 [doi]
- An Algorithm for Finding a Representation of a Subtree DistanceKazutoshi Ando, Koki Sato. 249-259 [doi]
- A Set Covering Approach for the Double Traveling Salesman Problem with Multiple StacksMichele Barbato, Roland Grappe, Mathieu Lacroix, Roberto Wolfler Calvo. 260-272 [doi]
- Shared Multicast Trees in Ad Hoc Wireless NetworksMarika Ivanová. 273-284 [doi]
- Two-Level Polytopes with a Prescribed FacetSamuel Fiorini, Vissarion Fisikopoulos, Marco Macchia. 285-296 [doi]
- Optimum Solution of the Closest String Problem via Rank DistanceClaudio Arbib, Giovanni Felici, Mara Servilio, Paolo Ventura. 297-307 [doi]
- Unrelated Parallel Machine Scheduling Problem with Precedence Constraints: Polyhedral Analysis and Branch-and-CutMohammed-Albarra Hassan Abdel-Jabbar, Imed Kacem, Sébastien Martin, Izzeldin M. Osman. 308-319 [doi]
- The Multi-terminal Vertex Separator Problem: Polytope Characterization and TDI-nessYoucef Magnouche, Sébastien Martin. 320-331 [doi]
- Toward Computer-Assisted Discovery and Automated Proofs of Cutting Plane TheoremsMatthias Köppe, Yuan Zhou. 332-344 [doi]
- Approximating Interval Selection on Unrelated Machines with Unit-Length Intervals and CoresKaterina Böhmová, Enrico Kravina, Matús Mihalák. 345-356 [doi]
- Balanced Partition of a Graph for Football Team Realignment in EcuadorDiego Recalde, Daniel Severin, Ramiro Torres, Polo Vaca. 357-368 [doi]
- On a General Framework for Network Representability in Discrete Optimization - (Extended Abstract)Yuni Iwamasa. 369-380 [doi]
- A Compact Representation for Minimizers of k-Submodular Functions (Extended Abstract)Hiroshi Hirai, Taihei Oki. 381-392 [doi]
- Optimization Models for Multi-period Railway Rolling Stock AssignmentSusumu Morito, Yuho Takehi, Jun Imaizumi, Takayuki Shiina. 393-402 [doi]
- Sum-of-Squares Rank Upper Bounds for Matching ProblemsAdam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli. 403-413 [doi]
- A Novel SDP Relaxation for the Quadratic Assignment Problem Using Cut Pseudo BasesMaximilian John, Andreas Karrenbauer. 414-425 [doi]
- The Maximum Matrix Contraction ProblemDimitri Watel, Pierre-Louis Poirion. 426-438 [doi]
- Integrated Production Scheduling and Delivery Routing: Complexity Results and Column GenerationAzeddine Cheref, Christian Artigues, Jean-Charles Billaut, Sandra Ulrich Ngueveu. 439-450 [doi]