Abstract is missing.
- Cluster Editing with Vertex SplittingFaisal N. Abu-Khzam, Judith Egan, Serge Gaspers, Alexis Shaw, Peter Shaw 0001. 1-13 [doi]
- Compact MILP Formulations for the p-Center ProblemZacharie Ales, Sourour Elloumi. 14-25 [doi]
- The Next Release Problem: Complexity, Exact Algorithms and ComputationsJosé Carlos Almeida Jr., Felipe de C. Pereira, Marina V. A. Reis, Breno Piva. 26-38 [doi]
- Polytope Membership in High DimensionEvangelos Anagnostopoulos, Ioannis Z. Emiris, Vissarion Fisikopoulos. 39-51 [doi]
- Graph Orientation with SplitsYuichi Asahiro, Jesper Jansson, Eiji Miyano, Hesam Nikpey, Hirotaka Ono. 52-63 [doi]
- The Stop Number Minimization Problem: Complexity and Polyhedral AnalysisMourad Baïou, Rafael Colares, Hervé Kerivin. 64-76 [doi]
- Maximum Concurrent Flow with Incomplete DataPierre-Olivier Bauguion, Claudia D'Ambrosio, Leo Liberti. 77-88 [doi]
- Characterising Chordal Contact B_0 -VPG GraphsFlavia Bonomo, María Pía Mazzoleni, Mariano Leonardo Rean, Bernard Ries. 89-100 [doi]
- Approximating the Caro-Wei Bound for Independent Sets in Graph StreamsGraham Cormode, Jacques Dark, Christian Konrad. 101-114 [doi]
- The Minimum Rooted-Cycle Cover ProblemDenis Cornaz, Youcef Magnouche. 115-120 [doi]
- Online Firefighting on TreesPierre Coupechoux, Marc Demange, David Ellison, Bertrand Jouve. 121-132 [doi]
- A Multigraph Formulation for the Generalized Minimum Spanning Tree ProblemErnando Gomes de Sousa, Rafael Castro de Andrade, Andréa Cynthia Santos. 133-143 [doi]
- The Distance Polytope for the Vertex Coloring ProblemBruno Dias, Rosiane de Freitas Rodrigues, Nelson Maculan, Javier Marenco. 144-156 [doi]
- A PTAS for the Time-Invariant Incremental Knapsack ProblemYuri Faenza, Igor Malinovic. 157-169 [doi]
- On Bounded Pitch Inequalities for the Min-Knapsack PolytopeYuri Faenza, Igor Malinovic, Monaldo Mastrolilli, Ola Svensson. 170-182 [doi]
- Efficient Algorithms for Measuring the Funnel-Likeness of DAGsMarcelo Garlet Millani, Hendrik Molter, Rolf Niedermeier, Manuel Sorge. 183-195 [doi]
- Jointly Optimizing Replica Placement, Requests Distribution and Server Storage Capacity on Content Distribution NetworksRaquel Gerhardt, Tiago Neves, Luis Rangel. 196-207 [doi]
- An Exact Column Generation-Based Algorithm for Bi-objective Vehicle Routing ProblemsEstèle Glize, Nicolas Jozefowiez, Sandra Ulrich Ngueveu. 208-218 [doi]
- Multi-start Local Search Procedure for the Maximum Fire Risk Insured Capital ProblemMaria Isabel Gomes, Lourdes B. Afonso, Nelson Chibeles-Martins, Joana M. Fradinho. 219-227 [doi]
- A Branch-and-Bound Procedure for the Robust Cyclic Job Shop ProblemIdir Hamaz, Laurent Houssin, Sonia Cafieri. 228-240 [doi]
- An Exact Algorithm for the Split-Demand One-Commodity Pickup-and-delivery Travelling Salesman ProblemHipólito Hernández-Pérez, Juan José Salazar González. 241-252 [doi]
- Descent with Mutations Applied to the Linear Ordering ProblemOlivier Hudry. 253-264 [doi]
- Characterization and Approximation of Strong General Dual Feasible FunctionsMatthias Köppe, Jiawei Wang. 265-276 [doi]
- Preemptively Guessing the CenterChristian Konrad, Tigran Tonoyan. 277-289 [doi]
- Improved Algorithms for k-Domination and Total k-Domination in Proper Interval GraphsNina Chiarelli, Tatiana Romina Hartinger, Valeria Alejandra Leoni, Maria Inés Lopez Pujato, Martin Milanic. 290-302 [doi]
- A Heuristic for Maximising Energy Efficiency in an OFDMA System Subject to QoS ConstraintsAdam N. Letchford, Qiang Ni, Zhaoyu Zhong. 303-312 [doi]
- An Integer Programming Approach to the Student-Project Allocation Problem with Preferences over ProjectsDavid Manlove, Duncan Milne, Sofiat Olaosebikan. 313-325 [doi]
- Even Flying Cops Should Think AheadAnders Martinsson, Florian Meier, Patrick Schnider, Angelika Steger. 326-337 [doi]
- A Generalization of the Minimum Branch Vertices Spanning Tree ProblemMassinissa Merabet, Jitamitra Desai, Miklós Molnár. 338-351 [doi]
- A Polyhedral View to Generalized Multiple Domination and Limited PackingJosé Neto. 352-363 [doi]
- Alternating Current Optimal Power Flow with Generator SelectionEsteban Salgado, Andrea Scozzari, Fabio Tardella, Leo Liberti. 364-375 [doi]
- Parameterized Algorithms for Module Map ProblemsFrank Sommer, Christian Komusiewicz. 376-388 [doi]
- 2 CSPs All Are Approximable Within a Constant Differential FactorJean-François Culus, Sophie Toulouse. 389-401 [doi]
- Finding Minimum Stopping and Trapping Sets: An Integer Linear Programming ApproachAlvaro Velasquez, K. Subramani, Steven L. Drager. 402-415 [doi]
- Lovász-Schrijver PSD-Operator on Some Graph Classes Defined by Clique CutsetsAnnegret Wagler. 416-427 [doi]