Mathematical Programming, Volume 105

Volume 105, Number 1, January 2006

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

Volume 105, Number 2-3, February 2006

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