Volume 139, Issue 1 | Annals of Operations Research

Search all Annals of Operations Research articles

Volume 139, Issue 1

October 2005

Integer Programming: State of the Art and Recent Advances-Part I

Issue Editors:

Monique Guignard-Spielberg,
Kurt Spielberg

15 articles in this issue

Preface
Monique Guignard-Spielberg
Kurt Spielberg
OriginalPaper Pages: 17 - 20
Cover and Pack Inequalities for (Mixed) Integer Programming
Alper Atamtürk
OriginalPaper Pages: 21 - 38
A Mixed-Integer Programming Model for Gas Purchase and Transportation
Luis Contesse
Juan Carlos Ferrer
Sergio Maturana
OriginalPaper Pages: 39 - 63
Recent Advances for the Quadratic Assignment Problem with Special Emphasis on Instances that are Difficult for Meta-Heuristic Methods
Zvi Drezner
Peter M. Hahn
Éeric D. Taillard
OriginalPaper Pages: 65 - 94
Depth-Optimized Convexity Cuts
Jonathan Eckstein
Mikhail Nediak
OriginalPaper Pages: 95 - 129
Mixed Integer Linear Programming in Process Scheduling: Modeling, Algorithms, and Applications
Christodoulos A. Floudas
Xiaoxia Lin
OriginalPaper Pages: 131 - 162
About Lagrangian Methods in Integer Optimization
Antonio Frangioni
OriginalPaper Pages: 163 - 193
The Multidimensional 0-1 Knapsack Problem—Bounds and Computational Aspects
Arnaud Fréville
SaÏd Hanafi
OriginalPaper Pages: 195 - 227
An Unconstrained Quadratic Binary Programming Approach to the Vertex Coloring Problem
Gary A. Kochenberger
Fred Glover
Cesar Rego
OriginalPaper Pages: 229 - 241
Rapid Prototyping of Optimization Algorithms Using COIN-OR: A Case Study Involving the Cutting-Stock Problem
Laszlo Ladanyi
Jon Lee
Robin Lougee-Heimer
OriginalPaper Pages: 243 - 265
Logic-Based Modeling and Solution of Nonlinear Discrete/Continuous Optimization Problems
Sangbum Lee
Ignacio E. Grossmann
OriginalPaper Pages: 267 - 288
A Conditional Logic Approach for Strengthening Mixed 0-1 Linear Programs
R. Lougee-Heimer
W. Adams
OriginalPaper Pages: 289 - 320
Classical Cuts for Mixed-Integer Programming and Branch-and-Cut
Manfred Padberg
OriginalPaper Pages: 321 - 352
An Adapted Step Size Algorithm for a 0-1 Biknapsack Lagrangean Dual
Babacar Thiongane
Anass Nagih
Gérard Plateau
OriginalPaper Pages: 353 - 373
On Compact Formulations for Integer Programs Solved by Column Generation
Daniel Villeneuve
Jacques Desrosiers
François Soumis
OriginalPaper Pages: 375 - 388