Optimization Online


Combinatorial Optimization Submissions - 2001

January 2001

Meta Heuristics
GRASP: An annotated bibliography
P. Festa, M. G. C. Resende

February 2001

Graphs and Matroids
Solving Steiner tree problems in graphs with Lagrangian relaxation
Laura Bahiense, Francisco Barahona, Oscar Porto

Stable Multi-Sets
Arie M.C.A. Koster, Adrian Zymolka

Meta Heuristics
Probability distribution of solution time in GRASP: An experimental investigation
Renata M. Aiex, Mauricio G. C. Resende, Celso C. Ribeiro

Meta Heuristics
GRASP with path relinking for the three-index assignment problem
Renata M. Aiex, Mauricio G. C. Resende, Panos M. Pardalos, Gerardo Toraldo

Branch-and-cut for the k-way equipartition problem
John E. Mitchell

March 2001

Discrete convexity and unimodularity. I.
Vladimir I. Danilov, Gleb A. Koshevoy

April 2001

Graphs and Matroids
Upper Bounds on ATSP Neighborhood Size
Gregory Gutin, Anders Yeo

May 2001

Meta Heuristics
A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs
Celso Ribeiro, Eduardo Uchoa, Renato Werneck

Meta Heuristics
Strategies for the Parallel Implementation of Metaheuristics
Van-Dat Cung, Simone Martins, Celso Ribeiro, Catherine Roucairol

Graphs and Matroids
Kernels in planar digraphs
Gregory Gutin, Ton Kloks, C.M. Lee

Branch and Cut Algorithms
Polyhedral results for two-connected networks with bounded rings
Bernard Fortz, Martine Labbé

A New Second-Order Cone Programming Relaxation for MAX-CUT problems
Masakazu Muramatsu, Tsunehiro Suzuki

July 2001

Graphs and Matroids
Feedback vertex sets and disjoint cycles in planar (di)graphs
Ton Kloks, C.M. Lee, Jim Liu

August 2001

Approximation Algorithms
Gregory Gutin, Anders Yeo

September 2001

Meta Heuristics
Greedy randomized adaptive search procedures
Mauricio G.C. Resende, Celso C. Ribeiro

New Benchmark Instances for the Steiner Problem in Graphs
Isabel Rosseti, Marcus Poggi de Aragăo, Celso Ribeiro, Eduardo Uchoa, Renato Werneck

October 2001

Meta Heuristics
A genetic algorithm for the weight setting problem in OSPF routing
M. Ericsson, M.G.C. Resende, P.M. Pardalos

November 2001

Meta Heuristics
Parallel GRASP with path-relinking for job shop scheduling
R.M. Aiex, S. Binato, M.G.C. Resende

December 2001

A Laplace transform algorithm for the volume of a convex polytope
Jean B. Lasserre, Eduardo S. Zeron

Branch and Cut Algorithms
Branch and cut based on the volume algorithm: Steiner trees in graphs and max-cut
Francisco Barahona, Lazslo Ladanyi

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


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