Optimization Online


Combinatorial Optimization Submissions - 2015

January 2015

Steiner Trees with Degree Constraints: Structural Results and an Exact Solution Approach
Frauke Liers, Alexander Martin, Susanne Pape

A Polyhedral Investigation of Star Colorings
Christopher Hojny, Marc E. Pfetsch

February 2015

Submodular Minimization in the Context of Modern LP and MILP Methods and Solvers
Andrew Orso, Jon Lee, Siqian Shen

On imposing connectivity constraints in integer programs
Yiming Wang, Austin Buchanan, Sergiy Butenko

Lower bounding procedure for the Asymmetric Quadratic Traveling Salesman Problem
Borzou Rostami, Federico Malucelli, Pietro Belotti, Stefano Gualandi

On the Quadratic Shortest Path Problem
Borzou Rostami, Federico Malucelli, Davide Frey, Christoph Buchheim

March 2015

Approximation Algorithms
Min-Morse: Approximability & Applications
Abhishek Rathore

Branch and Cut Algorithms
Machine Learning to Balance the Load in Parallel Branch-and-Bound
Alejandro Marcos Alvarez, Louis Wehenkel, Quentin Louveaux

April 2015

A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph
Andrea Bettinelli, Valentina Cacchiani, Enrico Malaguti

Exactly solving packing problems with fragmentation
Marco Casazza, Alberto Ceselli

Extended Formulations for Independence Polytopes of Regular Matroids
Volker Kaibel, Jon Lee, Matthias Walter, Stefan Weltge

Meta Heuristics
Beam Search for integer multi-objective optimization
Thibaut Barthelemy, Sophie Parragh, Fabien Tricoire, Richard Hartl

A Lex-BFS-based recognition algorithm for Robinsonian matrices
Monique Laurent, Matteo Seminaroti

May 2015

Approximation Algorithms
Search-Enhanced Instantaneous Frequency Detection Algorithm: A Preliminary Design
Phen Chiak See

Meta Heuristics
What Works Best When? A Framework for Systematic Heuristic Evaluation
Iain Dunning, Swati Gupta, John Silberholz

Branch and Cut Algorithms
Reoptimization Techniques for MIP Solvers
Gerald Gamrath, Benjamin Hiller, Jakob Witzig

Meta Heuristics
Solving maximum cut problems by simulated annealing
Tor G.J. Myklebust

Branch and Cut Algorithms
Stronger Multi-Commodity Flow Formulations of the (Capacitated) Sequential Ordering Problem
Adam N. Letchford, Juan José Salazar González

June 2015

Counterpart results in word spaces
Ujvari Miklos

Improved compact formulations for graph partitioning in sparse graphs
Dang Phuong Nguyen, Michel MINOUX, Viet Hung NGUYEN, Thanh Hai NGUYEN, Renaud SIRDEY

Polyhedral studies of vertex coloring problems: The standard formulation
Diego Delle Donne, Javier Marenco

Mathematical programming algorithms for spatial cloaking
Alberto Ceselli, Maria Luisa Damiani, Giovanni Righini, Diego Valorsi

July 2015

Asymptotic Behaviour of the Quadratic Knapsack Problem
Joachim Schauer

August 2015

Graphs and Matroids
Diffusion Methods for Classification with Pairwise Relationships
P. F. Felzenszwalb, B. F. Svaiter

New Valid Inequalities and Facets for the Simple Plant Location Problem
Laura Galli, Adam N. Letchford, Sebastian J. Miller

Approximation Algorithms
Semi-Online Scheduling on Two Uniform Machines with Known Optimum, Part I: Tight Lower Bounds
György Dósa, Armin Fügenschuh, Zhiyi Tan, Zsolt Tuza, Krzysztof Wesek

Approximation Algorithms
Semi-Online Scheduling on Two Uniform Machines with Known Optimum, Part II: Tight Upper Bounds
György Dósa, Armin Fügenschuh, Zhiyi Tan, Zsolt Tuza, Krzysztof Wesek

September 2015

Algorithms for the power-$p$ Steiner tree problem in the Euclidean plane
Christina Burt, Alysson Costa, Charl Ras

Detecting Almost Symmetries of Graphs
Ben Knueven, Jim Ostrowski, Sebastian Pokutta

Location Routing Problems on Simple Graphs
Julian Araoz, Elena Fernandez, Salvador Rueda

October 2015

Extended formulations for vertex cover
Austin Buchanan

On the Survivable Network Design Problem with Mixed Connectivity Requirements
E. Sadeghi, Neng Fan

On the Minimum-Cost $\lambda$-Edge-Connected $k$-Subgraph Problem
E. Sadeghi, Neng Fan

On the Lovasz Theta Function and Some Variants
Laura Galli, Adam N. Letchford

Rank aggregation in cyclic sequences
Javier Alcaraz, Eva García-Nove, Mercedes Landete, Juan Francisco Monge, Justo Puerto

The Budgeted Minimum Cost Flow Problem with Unit Upgrading Cost
Christina Büsing, Sarah Kirchner, Arie M.C.A. Koster, Annika Thome

On the computational complexity of minimum-concave-cost flow in a two-dimensional grid
Shabbir Ahmed, Qie He, Shi Li, George Nemhauser

November 2015

Totally Unimodular Congestion Games
Alberto Del Pia, Michael Ferris, Carla Michini

December 2015

Approximation Algorithms
A Deterministic Fully Polynomial Time Approximation Scheme For Counting Integer Knapsack Solutions Made Easy
Nir Halman

Branch and Cut Algorithms
Time Constrained Maximal Covering Salesman Problem with Weighted Demands and Partial Coverage
Gizem Ozbaygin, Hande Yaman, Oya E Karasan

On the diameter of lattice polytopes
Alberto Del Pia, Carla Michini

Euler Polytopes and Convex Matroid Optimization
Antoine Deza, George Manoussakis, Shmuel Onn

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