-

 

 

 




Optimization Online





 

Combinatorial Optimization Submissions - 2005

January 2005

Further Extension of TSP Assign Neighborhood
Gregory Gutin, Fred Glover

Graphs and Matroids
A linear programming approach to increasing the weight of all minimum spanning trees
Francisco Barahona, Mourad Baiou

Meta Heuristics
GRASP with path-relinking for the weighted maximum satisfiability problem
Paola Festa, Panos M. Pardalos, Leonidas S. Pitsoulis, Mauricio G. C. Resende


February 2005

Short communication: a larger clique for a DIMACS test
Andrea Grosso, Marco Locatelli, Wayne, J. Pullan

Strengthened Semidefinite Bounds for Codes
Monique Laurent

Branch and Cut Algorithms
Finding optimal realignments in sports leagues using a branch-and-cut-and-price approach
Xiaoyun Ji, John E Mitchell


March 2005

Semidefinite programming relaxations for graph coloring and maximal clique problems
Igor Dukanovic, Franz Rendl

Approximation Algorithms
Semidefinite Programming Based Approaches to Home-away Assignment Problems in Sports Scheduling
Ayami Suzuka, Ryuhei Miyashiro, Akiko Yoshise, Tomomi Matsui


April 2005

Other
Computing the stability number of a graph via linear and semidefinite programming
Javier Pena, Juan Vera, Luis Zuluaga

Graphs and Matroids
A semidefinite programming based heuristic for graph coloring
Igor Dukanovic, Franz Rendl


July 2005

Approximation Algorithms
Approximation Algorithms for Indefinite Complex Quadratic Maximization Problems
Yongwei Huang, Shuzhong Zhang


August 2005

Approximation Algorithms
A copositive programming approach to graph partitioning
Janez Povh, Franz Rendl


September 2005

Graphs and Matroids
Embedded in the Shadow of the Separator
Frank Göring, Christoph Helmberg, Markus Wappler


October 2005

Combinatorial relaxations of the k-traveling salesman problem
Andrei Horbach


December 2005

Graphs and Matroids
Comparing Imperfection Ratio and Imperfection Index for Graph Classes
Arie M.C.A. Koster, Annegret K. Wagler

Branch and Cut Algorithms
Set covering and packing formulations of graph coloring: algorithms and first polyhedral results
Pierre Hansen, Martine Labbé, David Schindl

Alternative Formulation for the p-median Problem
Sourour Elloumi

A counterexample to a conjecture of Laurent and Poljak
Antoine Deza, Gabriel Indik


  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