-

 

 

 




Optimization Online





 

Combinatorial Optimization Submissions - 2012

January 2012

Separable Concave Optimization Approximately Equals Piecewise-Linear Optimization
Thomas L. Magnanti, Dan Stratila


February 2012

Approximation Algorithms
Improved approximation algorithms for the facility location problems with linear/submodular penalty
Yu Li, Donglei Du, Naihua Xiu, Dachuan Xu

Strongly Polynomial Primal-Dual Algorithms for Concave Cost Combinatorial Optimization Problems
Thomas L. Magnanti, Dan Stratila

An aggressive reduction scheme for the simple plant location problem
Adam Letchford, Sebastian Miller


March 2012

Compact formulations of the Steiner traveling salesman problem and related problems
Adam Letchford, Saeideh Nasiri, Dirk Theis

A Dynamic Programming Heuristic for the Quadratic Knapsack Problem
Adam Letchford, Franklin Djeumou Fomeni

Branch and Cut Algorithms
Exact Algorithms for Combinatorial Optimization Problems with Submodular Objective Functions
Frank Baumann, Sebastian Berckey, Christoph Buchheim


April 2012

Meta Heuristics
A biased random-key genetic algorithm for a 2D and 3D bin packing problem
José F. Gonçalves, Mauricio G.C. Resende


May 2012

A Probabilistic Model for Minmax Regret in Combinatorial Optimization
Karthik Natarajan, Dongjian Shi, Kim Chuan Toh

Meta Heuristics
Evolutionary Dynamic Optimization: A Survey of the State of the Art
Trung Thanh Nguyen, Shengxiang Yang, Juergen Branke

Meta Heuristics
Continuous Dynamic Constrained Optimisation – The Challenges
Nguyen Trung Thanh, Xin Yao


June 2012

Polyhedra
The Hirsch Conjecture for the Fractional Stable Set Polytope
Carla Michini, Antonio Sassano


July 2012

A family of polytopes in the 0/1-cube with Gomory-Chvátal rank at least ((1+1/6)n - 4)
Can Kizilkale


October 2012

Approximation Algorithms
Approximating the Expected Utility Knapsack Problem
Shabbir Ahmed, Jiajin Yu


November 2012

An extended approach for lifting clique tree inequalities
Anja Fischer, Frank Fischer


December 2012

Exact Solution of the Robust Knapsack Problem
Michele Monaci, Ulrich Pferschy, Paolo Serafini

The Subset Sum Game
Andreas Darmann, Gaia Nicosia, Ulrich Pferschy, Joachim Schauer


  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 Optimization Society