Journal: Math. Program.

Volume 105, Issue 2-3

157 -- 160Thomas M. Liebling, Denis Naddef, Laurence A. Wolsey. Combinatorial Optimization: Theory and Computation The Aussois Workshop 2004
161 -- 179Michele Conforti, Giacomo Zambelli. Recognizing Balanceable Matrices
181 -- 200Francisco Barahona. Network reinforcement
201 -- 213Kathie Cameron, Pavol Hell. Independent packings in structured graphs
215 -- 232Dennis Michaels, Robert Weismantel. Polyhedra related to integer-convex polynomial systems
233 -- 250Flavia Bonomo, Guillermo Durán, Min Chih Lin, Jayme Luiz Szwarcfiter. On Balanced Graphs
251 -- 274Adam N. Letchford, Juan José Salazar González. Projection results for vehicle routing
275 -- 288Dirk Müller. On the complexity of the planar directed edge-disjoint paths problem
289 -- 310Jean Fonlupt, Ali Ridha Mahjoub. Critical extreme points of the 2-edge connected spanning subgraph polytope
311 -- 328Arnaud Pêcher, Annegret Wagler. Almost all webs are not rank-perfect
329 -- 344Denis Cornaz. A linear programming formulation for the maximum complete multipartite subgraph problem
345 -- 364Agostinho Agra, Miguel Fragoso Constantino. Polyhedral description of the integer single node flow set with constant bounds
365 -- 386Rüdiger Schultz, Stephan Tiedemann. Conditional Value-at-Risk in Stochastic Programs with Mixed-Integer Recourse
387 -- 425Ernst Althaus, Alberto Caprara, Hans-Peter Lenhof, Knut Reinert. A branch-and-cut algorithm for multiple sequence alignment
427 -- 449Ivana Ljubic, René Weiskircher, Ulrich Pferschy, Gunnar W. Klau, Petra Mutzel, Matteo Fischetti. An Algorithmic Framework for the Exact Solution of the Prize-Collecting Steiner Tree Problem
451 -- 469Ilse Fischer, Gerald Gruber, Franz Rendl, Renata Sotirov. Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and Equipartition
471 -- 499Roberto De Franceschi, Matteo Fischetti, Paolo Toth. A new ILP-based refinement heuristic for Vehicle Routing Problems
501 -- 522Mathieu Van Vyve, Laurence A. Wolsey. Approximate extended formulations
523 -- 561S. Shebalov, Diego Klabjan. Sequence Independent Lifting for Mixed Integer Programs with Variable Upper Bounds
563 -- 582Alexander Martin, Markus Möller, Susanne Moritz. Mixed Integer Models for the Stationary Case of Gas Network Optimization
583 -- 603Juan José Salazar González. Controlled rounding and cell perturbation: statistical disclosure limitation methods for tabular data

Volume 105, Issue 1

1 -- 8Richard W. Cottle. George B. Dantzig: a legendary life in mathematical programming
9 -- 27Daniel Bienstock, Mark Zuckerberg. Approximate fixed-rank closures of covering problems
29 -- 53Sanjeeb Dash, Oktay Günlük. Valid inequalities based on simple mixed-integer sets
55 -- 84Yongpei Guan, Shabbir Ahmed, George L. Nemhauser, Andrew J. Miller. A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem
85 -- 111Bernard Fortz, Ali Ridha Mahjoub, S. Thomas McCormick, Pierre Pesneau. Two-edge connected subgraphs with bounded rings: Polyhedral results and Branch-and-Cut
113 -- 143Mihai Anitescu. Optimization-based simulation of nonsmooth rigid multibody dynamics
145 -- 155J. B. G. Frenk, Gábor Kassay. The level set method of Joó and its use in minimax theory