Combinatorial Optimization Submissions  2014
January 2014
Approximation Algorithms
WorstCase Performance Analysis of Some Approximation Algorithms for Minimizing Makespan and FlowTime
Peruvemba Sundaram Ravi, Levent Tuncel, Michael Huang
Eigenvalue, Quadratic Programming, and Semidefinite Programming Bounds for Vertex Separators
Ting Kei Pong, Hao Sun, Ningchuan Wang, Henry Wolkowicz
February 2014
SingleMachine TwoAgent Scheduling Problems with Unconstrained Strategies
Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy
Branchandcut and Branchandcutandprice Algorithms for the Adjacent Only Quadratic Minimum Spanning Tree Problem
Dilson Lucas Pereira, Michel Gendreau, Alexandre Salles Cunha
Approximation Algorithms
Approximating Convex Functions By NonConvex Oracles Under The Relative Noise Model
Nir Halman
Other
A BranchandBound Algorithm for the CloseEnough Traveling Salesman Problem
Walton Coutinho, Roberto do Nascimento, Artur Pessoa, Anand Subramanian
Other
A Trust Region Method for the Solution of the Surrogate Dual in Integer Programming
N Boland, A Eberhard, A Tsoukalas
Generating subtour constraints for the TSP from pure integer solutions
Ulrich Pferschy, Rostislav Staněk
Meta Heuristics
Nonmonotone GRASP
M. De Santis, P. Festa, G. Liuzzi, S. Lucidi, F. Rinaldi
April 2014
Unifying setcopositive formulations of binary problems and randomization techniques
Felix Lieder, Fatameh Bani Asadi Rad Rad, Florian Jarre
May 2014
The constant objective value property for combinatorial optimization problems
Ante Custic, Bettina Klinz
June 2014
Branch and Cut Algorithms
On the Circulant Inequalities for the Simple Plant Location Problem
Adam N Letchford, Sebastian J Miller
Branch and Cut Algorithms
A CutandBranch Algorithm for the Quadratic Knapsack Problem
Franklin Djeumou Fomeni, Konstantinos Kaparis, Adam N Letchford
Graphs and Matroids
On the shortest path game
Andreas Darmann, Ulrich Pferschy, Joachim Schauer
Stronger MultiCommodity Flow Formulations of the Capacitated Vehicle Routing Problem
Adam N Letchford, JuanJose SalazarGonzalez
Bounds and Algorithms for the Knapsack Problem with Conflict Graph
Andrea Bettinelli, Valentina Cacchiani, Enrico Malaguti
July 2014
Graphs and Matroids
Analyzing NodeWeighted Oblivious Matching Problem via Continuous LP with Jump Discontinuity
TH. Hubert Chan, Fei Chen, Xiaowei Wu
Polyhedra
Circuit and bond polytopes on seriesparallel graphs
S. Borne, P. Fouilhoux, R. Grappe, M. Lacroix, P. Pesneau
The Quadratic Assignment Problem is Easy for Robinsonian Matrices
Monique Laurent, Matteo Seminaroti
August 2014
Graphs and Matroids
Bounds on the stability number of a graph via the inverse theta function
Ujvári Miklós
Other
Homotopy methods based on l0 norm for the compressed sensing problem
Wenxing Zhu, Zhengshan Dong
Other
Discretization vertex orders in distance geometry
Andrea Cassioli, Oktay Gunluk, Carlile Lavor, Leo Liberti
September 2014
Graphs and Matroids
On laminar matroids and bmatchings
Konstantinos Kaparis, Adam N. Letchford
Tight extended formulations for independent set
Austin Buchanan, Sergiy Butenko
Lower Bounds for the Quadratic Minimum Spanning Tree Problem Based on Reduced Cost Computation
Borzou Rostami, Federico Malucelli
A Tight Lower Bound for the Adjacent Quadratic Assignment Problem
Borzou Rostami, Federico Malucelli, Pietro Belotti
Approximation Algorithms
Approximation algorithms for the Transportation Problem with Market Choice and related models
Karen Aardal, Pierre Le Bodic
October 2014
Branch and Cut Algorithms
Solving bilevel combinatorial optimization as bilinear minmax optimization via a branchandcut algorithm
Artur Alves Pessoa, Michael Poss, Marcos Costa Roboredo
MaximumDemand Rectangular Location Problem
Manish Bansal, Kiavash Kianfar
Robust constrained shortest path problems under budgeted uncertainty
Artur Alves Pessoa, Luigi di Puglia Pugliese, Francesca Guerriero, Michael Poss
November 2014
Approximation Algorithms
A PTAS for TSP with Fat Weakly Disjoint Neighborhoods in Doubling Metrics
TH. Hubert Chan, Shaofeng H.C. Jiang
Lov\'{a}szSchrijver SDPoperator, nearperfect graphs and nearbipartite graphs
S. Bianchi, M. Escalante, G. Nasini, Levent Tuncel
Approximation Algorithms
Approximation of Knapsack Problems with Conflict and Forcing Graphs
Ulrich Pferschy, Joachim Schauer
