Optimization Online


Combinatorial Optimization Submissions - 2004

January 2004

Interior Point and Semidefinite Approaches in Combinatorial Optimization
Kartik Krishnan, Tamas Terlaky

February 2004

Introduction to Domination Analysis
Gregory Gutin, Anders Yeo

Batched Bin Packing
Gregory Gutin, Tommy Jensen, Anders Yeo

The Complexity of Maximum Matroid-Greedoid Intersection and Weighted Greedoid Maximization
Taneli Mielikšinen, Esko Ukkonen

May 2004

Branch and Cut Algorithms
A semidefinite programming based polyhedral cut and price algorithm for the maxcut problem
Kartik Krishnan, John Mitchell

June 2004

Graphs and Matroids
Kernels in planar digraphs
Gregory Gutin, Ton Kloks, Chuan Min Lee, Anders Yeo

July 2004

On cost matrices with two and three distinct values of Hamiltonian paths and cycles
Santosh N. Kabadi, Abraham P. Punnen

August 2004

Single Machine Scheduling with Precedence Constraints
Josť R. Correa, Andreas S. Schulz

Approximation Algorithms
Faster approximation algorithms for packing and covering problems
Daniel Bienstock, Garud Iyengar

Graphs and Matroids
Note: A Graph-Theoretical Approach to Level of Repair Analysis
G Gutin, A Rafiey, A Yeo, M Tso

Meta Heuristics
A GRASP algorithm for the multi-objective knapsack problem
Dalessandro Vianna, Josť Elias Arroyo

Approximation Algorithms
Complex Quadratic Optimization and Semidefinite Programming
Shuzhong Zhang, Yongwei Huang

September 2004

Domination between traffic matrices
Gianpaolo Oriolo

$\epsilon$-Optimization Schemes and $L$-Bit Precision: Alternative Perspectives for Solving Combinatorial Optimization Problems
James B. Orlin, Andreas S. Schulz, Sudipta Sengupta

Semi-Lagrangian relaxation
Cesar Beltran, Claude Tadonki, Vial Jean-philippe.

October 2004

A test problem of circles packing with best known optimum solution
Teng Hong-fei, Che Chao, Chen Yu, Wang Yi-shou

November 2004

Branch and Cut Algorithms
Stabilized Branch-and-cut-and-price for the Generalized Assignment Problem
Alexandre Pigatti, Marcus Poggi de Arag„o, Eduardo Uchoa

An Annotated Bibliography on Robustness in Combinatorial Optimization and Scheduling Theory
Yury Nikulin

Circular Ones Matrices and the Stable Set Polytope of Quasi-Line Graphs
Friedrich Eisenbrand, Gianpaolo Oriolo, Gautier Stauffer, Paolo Ventura

December 2004

Meta Heuristics
Parallel Greedy Randomized Adaptive Search Procedures
Mauricio G. C. Resende, Celso C. Ribeiro

Graphs and Matroids
Finding good nearly balanced cuts in power law graphs
Kevin Lang

  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