-

 

 

 




Optimization Online





 

Combinatorial Optimization Submissions - 2003

January 2003

Approximation Algorithms
Approximation Bounds for Quadratic Maximization with Semidefinite Programming Relaxation
Dachuan Xu, Shuzhong Zhang


February 2003

Graphs and Matroids
On the Representation and Characterization of Fullerene C60
Siemion Fajtlowicz


March 2003

Polyhedra
On counting integral points in a convex rational polytope
Jean B. Lasserre, Eduardo S. Zeron

Design and analysis of an approximation algorithm for Stackelberg network pricing
Sebastien Roch, Patrice Marcotte, Gilles Savard

When the greedy algorithm fails
Joergen Bang-Jensen, Gregory Gutin, Anders Yeo

Branch and Cut Algorithms
Computational study of large-scale p-Median problems
Pasquale Avella, Antonio Sassano, Igor Vasil'ev

Graphs and Matroids
Partition of a Set of Integers into Subsets with Prescribed Sums
Wang Yiju


April 2003

Meta Heuristics
GRASP and path-relinking: Recent advances and applications
Mauricio G. C. Resende, Celso C. Ribeiro

Algorithms with large domination ratio
Noga Alon, Gregory Gutin, Michael Krivelevich

Branch and Cut Algorithms
A Branch and Cut Algorithm for Hub Location Problems with Single Assignment
Martine Labbé, Hande Yaman, Eric Gourdin


June 2003

A hybrid heuristic for the P-median problem
Mauricio G. C. Resende, Renato F. Werneck


July 2003

Approximation Algorithms
Approximating the Two-Level Facility Location Problem Via a Quasi-Greedy Approach
Jiawei Zhang

Approximate Local Search in Combinatorial Optimization
James B. Orlin, Abraham P. Punnen, Andreas S. Schulz

Lift-and-project ranks and antiblocker duality
Laszlo Liptak, Levent Tuncel

Approximation Algorithms
Domination analysis for minimum multiprocessor scheduling
Gregory Gutin, Tommy Jensen, Anders Yeo

Polyhedra
Polyhedral Analysis for Concentrator Location Problems
Martine Labbé, Hande Yaman


August 2003

Polyhedra
Polyhedral investigations on stable multi-sets
Arie M.C.A. Koster, Adrian Zymolka

Bounds for the Quadratic Assignment Problem Using the Bundle Method
Franz Rendl, Renata Sotirov


September 2003

Branch and Cut Algorithms
The Quadratic Selective Travelling Saleman Problem
Tommy Thomadsen, Thomas Stidsen

Branch and Cut Algorithms
A Branch-and-Cut Algorithm for Graph Coloring
Isabel Méndez-Díaz, Paula Zabala

The Generalized Subgraph Problem: Complexity, Approximability and Polyhedra
Corinne Feremans, Martine Labbé, Adam Letchford, Juan José Salazar

The Bundle Method in Combinatorial Optimization
Ilse Fischer , Gerald Gruber, Franz Rendl, Renata Sotirov

Graphs and Matroids
Network Reinforcement
Francisco Barahona


October 2003

On-Line Scheduling to Minimize Average Completion Time Revisited
Nicole Megow, Andreas S. Schulz

Meta Heuristics
GRASP and path-relinking: Recent advances and applications
Maurício Resende, Celso Ribeiro

On Extracting Maximum Stable Sets in Perfect Graphs Using Lovasz's Theta Function
E. Alper Yildirim, Xiaofei Fan

Meta Heuristics
An updated bibliography of GRASP
Mauricio G. C. Resende, Paola Festa

Approximation Algorithms
A Multi-Exchange Local Search Algorithm for the Capacitated Facility Location Problem
Jiawei Zhang, Bo Chen, Yinyu Ye

Meta Heuristics
Parallel Strategies for GRASP with path-relinking
Renata M. Aiex, Mauricio G. C. Resende


November 2003

Approximation Algorithms
Computational Complexity, Fairness, and the Price of Anarchy of the Maximum Latency Problem
Jose R. Correa, Andreas S. Schulz, Nicolas E. Stier Moses


December 2003

Polyhedra
Boundedness Theorems for the Relaxation Method
Edoardo Amaldi, Raphael Hauser


  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository

 

Submit
Update
Policies
Coordinator's Board
Classification Scheme
Credits
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society