Volume 105, issue 2-3, February 2006

21 articles in this issue

Combinatorial Optimization: Theory and Computation The Aussois Workshop 2004

Authors
- Thomas M. Liebling
- Denis Naddef
- Laurence A. Wolsey
- Content type: OriginalPaper
- Published: 10 November 2005
- Pages: 157 - 160
Recognizing Balanceable Matrices

Authors
- Michele Conforti
- Giacomo Zambelli
- Content type: OriginalPaper
- Published: 10 November 2005
- Pages: 161 - 179
Network reinforcement

Authors
- Francisco Barahona
- Content type: OriginalPaper
- Published: 10 November 2005
- Pages: 181 - 200
Independent packings in structured graphs

Authors
- Kathie Cameron
- Pavol Hell
- Content type: OriginalPaper
- Published: 14 November 2005
- Pages: 201 - 213
Polyhedra related to integer-convex polynomial systems

Authors
- Dennis Michaels
- Robert Weismantel
- Content type: OriginalPaper
- Published: 12 October 2005
- Pages: 215 - 232
On Balanced Graphs

Authors (first, second and last of 4)
- Flavia Bonomo
- Guillermo Durán
- Jayme L Szwarcfiter
- Content type: OriginalPaper
- Published: 10 November 2005
- Pages: 233 - 250
Projection results for vehicle routing

Authors
- Adam N. Letchford
- Juan-José Salazar-González
- Content type: OriginalPaper
- Published: 12 October 2005
- Pages: 251 - 274
On the complexity of the planar directed edge-disjoint paths problem

Authors
- Dirk Müller
- Content type: OriginalPaper
- Published: 12 October 2005
- Pages: 275 - 288
Critical extreme points of the 2-edge connected spanning subgraph polytope

Authors
- Jean Fonlupt
- A. Ridha Mahjoub
- Content type: OriginalPaper
- Published: 10 November 2005
- Pages: 289 - 310
Almost all webs are not rank-perfect

Authors
- Arnaud Pêcher
- Annegret K. Wagler
- Content type: OriginalPaper
- Published: 12 October 2005
- Pages: 311 - 328
A linear programming formulation for the maximum complete multipartite subgraph problem

Authors
- Denis Cornaz
- Content type: OriginalPaper
- Published: 10 November 2005
- Pages: 329 - 344
Polyhedral description of the integer single node flow set with constant bounds

Authors
- Agostinho Agra
- Miguel F. Constantino
- Content type: OriginalPaper
- Published: 12 October 2005
- Pages: 345 - 364
Conditional Value-at-Risk in Stochastic Programs with Mixed-Integer Recourse

Authors
- Rüdiger Schultz
- Stephan Tiedemann
- Content type: OriginalPaper
- Published: 10 November 2005
- Pages: 365 - 386
A branch-and-cut algorithm for multiple sequence alignment

Authors (first, second and last of 4)
- Ernst Althaus
- Alberto Caprara
- Knut Reinert
- Content type: OriginalPaper
- Published: 10 November 2005
- Pages: 387 - 425
An Algorithmic Framework for the Exact Solution of the Prize-Collecting Steiner Tree Problem

Authors (first, second and last of 6)
- Ivana Ljubić
- René Weiskircher
- Matteo Fischetti
- Content type: OriginalPaper
- Published: 12 October 2005
- Pages: 427 - 449
Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and Equipartition

Authors (first, second and last of 4)
- Ilse Fischer
- Gerald Gruber
- Renata Sotirov
- Content type: OriginalPaper
- Published: 12 October 2005
- Pages: 451 - 469
A new ILP-based refinement heuristic for Vehicle Routing Problems

Authors
- Roberto De Franceschi
- Matteo Fischetti
- Paolo Toth
- Content type: OriginalPaper
- Published: 14 November 2005
- Pages: 471 - 499
Approximate extended formulations

Authors
- Mathieu Van Vyve
- Laurence A. Wolsey
- Content type: OriginalPaper
- Published: 12 October 2005
- Pages: 501 - 522
Sequence Independent Lifting for Mixed Integer Programs with Variable Upper Bounds

Authors
- S. Shebalov
- D. Klabjan
- Content type: OriginalPaper
- Published: 12 October 2005
- Pages: 523 - 561
Mixed Integer Models for the Stationary Case of Gas Network Optimization

Authors
- Alexander Martin
- Markus Möller
- Susanne Moritz
- Content type: OriginalPaper
- Published: 10 November 2005
- Pages: 563 - 582
Controlled rounding and cell perturbation: statistical disclosure limitation methods for tabular data

Authors
- Juan-José Salazar-González
- Content type: OriginalPaper
- Published: 12 October 2005
- Pages: 583 - 603

Volume 105, issue 2-3, February 2006

Combinatorial Optimization: Theory and Computation The Aussois Workshop 2004

Recognizing Balanceable Matrices

Network reinforcement

Independent packings in structured graphs

Polyhedra related to integer-convex polynomial systems

On Balanced Graphs

Projection results for vehicle routing

On the complexity of the planar directed edge-disjoint paths problem

Critical extreme points of the 2-edge connected spanning subgraph polytope

Almost all webs are not rank-perfect

A linear programming formulation for the maximum complete multipartite subgraph problem

Polyhedral description of the integer single node flow set with constant bounds

Conditional Value-at-Risk in Stochastic Programs with Mixed-Integer Recourse

A branch-and-cut algorithm for multiple sequence alignment

An Algorithmic Framework for the Exact Solution of the Prize-Collecting Steiner Tree Problem

Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and Equipartition

A new ILP-based refinement heuristic for Vehicle Routing Problems

Approximate extended formulations

Sequence Independent Lifting for Mixed Integer Programs with Variable Upper Bounds

Mixed Integer Models for the Stationary Case of Gas Network Optimization

Controlled rounding and cell perturbation: statistical disclosure limitation methods for tabular data

For authors

Working on a manuscript?

Explore

Navigation

Volume 105, issue 2-3, February 2006

Authors

Authors

Authors

Authors

Authors

Authors (first, second and last of 4)

Authors

Authors

Authors

Authors

Authors

Authors

Authors

Authors (first, second and last of 4)

Authors (first, second and last of 6)

Authors (first, second and last of 4)

Authors

Authors

Authors

Authors

Authors

For authors

Working on a manuscript?

Explore

search

Navigation