Adam N. Letchford

Licong Cheng

Oper. Res. Lett., 2024

On upper bounds for the multiple knapsack assignment problem.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2024

CP-Lib: Benchmark Instances of the Clique Partitioning Problem.

[BibT_eX]

[DOI]

Michael Malmros Sørensen

Math. Program. Comput., 2024

2023

Matheuristics: survey and synthesis.

[BibT_eX]

[DOI]

Marco A. Boschetti

Vittorio Maniezzo

Int. Trans. Oper. Res., November, 2023

On cut polytopes and graph minors.

[BibT_eX]

[DOI]

Ioannis Mourtos

Discret. Optim., November, 2023

On some lower bounds for the permutation flowshop problem.

[BibT_eX]

[DOI]

Sebastian Cáceres Gelvez

Comput. Oper. Res., November, 2023

A survey on exact algorithms for the maximum flow and minimum-cost flow problems.

[BibT_eX]

[DOI]

Oliverio Cruz-Mejia

Networks, September, 2023

Fast upper and lower bounds for a large-scale real-world arc routing problem.

[BibT_eX]

[DOI]

Networks, January, 2023

Improving a constructive heuristic for the general routing problem.

[BibT_eX]

[DOI]

Networks, January, 2023

2022

Generalised 2-circulant inequalities for the max-cut problem.

[BibT_eX]

[DOI]

Ioannis Mourtos

Oper. Res. Lett., 2022

Revisiting surrogate relaxation for the multidimensional knapsack problem.

[BibT_eX]

[DOI]

Trivikram Dokka

M. Hasan Mansoor

Oper. Res. Lett., 2022

On matchings, T-joins, and arc routing in road networks.

[BibT_eX]

[DOI]

Networks, 2022

Newsvendor problems: An integrated method for estimation and optimisation.

[BibT_eX]

[DOI]

Congzheng Liu

Ivan Svetunkov

Eur. J. Oper. Res., 2022

A cut-and-branch algorithm for the Quadratic Knapsack Problem.

[BibT_eX]

[DOI]

Franklin Djeumou Fomeni

Discret. Optim., 2022

2021

Strengthened clique-family inequalities for the stable set polytope.

[BibT_eX]

[DOI]

Paolo Ventura

Oper. Res. Lett., 2021

A separation algorithm for the simple plant location problem.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2021

On the complexity of surrogate and group relaxation for integer linear programs.

[BibT_eX]

[DOI]

Trivikram Dokka

M. Hasan Mansoor

Oper. Res. Lett., 2021

Facets from gadgets.

[BibT_eX]

[DOI]

Anh N. Vu

Math. Program., 2021

Bi-perspective functions for mixed-integer fractional programs with indicator variables.

[BibT_eX]

[DOI]

Math. Program., 2021

Valid inequalities for quadratic optimisation with domain constraints.

[BibT_eX]

[DOI]

Discret. Optim., 2021

Vehicle routing on road networks: How good is Euclidean approximation?

[BibT_eX]

[DOI]

Comput. Oper. Res., 2021

2020

Lifting the knapsack cover inequalities for the knapsack polytope.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2020

Valid inequalities for mixed-integer programmes with fixed charges on sets of variables.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2020

A heuristic for fair dynamic resource allocation in overloaded OFDMA systems.

[BibT_eX]

[DOI]

J. Heuristics, 2020

Adaptive policies for perimeter surveillance problems.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2020

On matroid parity and matching polytopes.

[BibT_eX]

[DOI]

Ioannis Mourtos

Discret. Appl. Math., 2020

The stable set problem: Clique and nodal inequalities revisited.

[BibT_eX]

[DOI]

Fabrizio Rossi

Stefano Smriglio

Comput. Oper. Res., 2020

Using ℓp-norms for fairness in combinatorial optimisation.

[BibT_eX]

[DOI]

Tolga Bektas

Comput. Oper. Res., 2020

2019

New valid inequalities for the fixed-charge and single-node flow polytopes.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2019

On lifted cover inequalities: A new lifting procedure with unusual properties.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2019

The Capacitated Vehicle Routing Problem: Stronger bounds in pseudo-polynomial time.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2019

2018

A guide to conic optimisation and its applications.

[BibT_eX]

[DOI]

Andrew J. Parkes

RAIRO Oper. Res., 2018

A note on the 2-circulant inequalities for the max-cut problem.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2018

A binarisation heuristic for non-convex quadratic programming with box constraints.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2018

New valid inequalities and facets for the Simple Plant Location Problem.

[BibT_eX]

[DOI]

Sebastian J. Miller

Eur. J. Oper. Res., 2018

A two-level graph partitioning problem arising in mobile wireless communications.

[BibT_eX]

[DOI]

Jamie Fairbrother

Keith Briggs

Comput. Optim. Appl., 2018

A Heuristic for Maximising Energy Efficiency in an OFDMA System Subject to QoS Constraints.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization - 5th International Symposium, 2018

2017

A note on representations of linear inequalities in non-convex mixed-integer quadratic programs.

[BibT_eX]

[DOI]

Daniel John Grainger

Oper. Res. Lett., 2017

On the Lovász theta function and some variants.

[BibT_eX]

[DOI]

Discret. Optim., 2017

Projection results for the -partition problem.

[BibT_eX]

[DOI]

Jamie Fairbrother

Discret. Optim., 2017

An exact algorithm for a resource allocation problem in mobile wireless communications.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2017

2016

Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2016

Strengthening Chvátal-Gomory Cuts for the Stable Set Problem.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization - 4th International Symposium, 2016

2015

Ellipsoidal Relaxations of the Stable Set Problem: Theory and Algorithms.

[BibT_eX]

[DOI]

SIAM J. Optim., 2015

The 2013 Newton Institute Programme on polynomial optimization.

[BibT_eX]

[DOI]

Math. Program., 2015

Cutting planes for RLT relaxations of mixed 0-1 polynomial programs.

[BibT_eX]

[DOI]

Franklin Djeumou Fomeni

Math. Program., 2015

The Steiner travelling salesman problem with correlated costs.

[BibT_eX]

[DOI]

Saeideh D. Nasiri

Eur. J. Oper. Res., 2015

Stronger multi-commodity flow formulations of the Capacitated Vehicle Routing Problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2015

2014

Iterated Chvátal-Gomory Cuts and the Geometry of Numbers.

[BibT_eX]

[DOI]

Iskander Aliev

SIAM J. Optim., 2014

A compact variant of the QCR method for quadratically constrained quadratic 0-1 programs.

[BibT_eX]

[DOI]

Optim. Lett., 2014

Unbounded convex sets for non-convex mixed-integer quadratic programming.

[BibT_eX]

[DOI]

Samuel Burer

Math. Program., 2014

A Dynamic Programming Heuristic for the Quadratic Knapsack Problem.

[BibT_eX]

[DOI]

Franklin Djeumou Fomeni

INFORMS J. Comput., 2014

An aggressive reduction scheme for the simple plant location problem.

[BibT_eX]

[DOI]

Sebastian J. Miller

Eur. J. Oper. Res., 2014

A new separation algorithm for the Boolean quadric and cut polytopes.

[BibT_eX]

[DOI]

Michael Malmros Sørensen

Discret. Optim., 2014

Pricing routines for vehicle routing with time windows on road networks.

[BibT_eX]

[DOI]

André Renato Sales Amaral

Saeideh D. Nasiri

Amar Oukil

Comput. Oper. Res., 2014

2013

A polyhedral approach to the single row facility layout problem.

[BibT_eX]

[DOI]

Math. Program., 2013

Compact formulations of the Steiner Traveling Salesman Problem and related problems.

[BibT_eX]

[DOI]

Saeideh D. Nasiri

Eur. J. Oper. Res., 2013

Approximating the Lovász θ Function with the Subgradient Method.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2013

2012

Complexity results for the gap inequalities for the max-cut problem.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2012

Binary positive semidefinite matrices and associated integer polytopes.

[BibT_eX]

[DOI]

Michael Malmros Sørensen

Math. Program., 2012

Fast bounding procedures for large instances of the Simple Plant Location Problem.

[BibT_eX]

[DOI]

Sebastian J. Miller

Comput. Oper. Res., 2012

Gap Inequalities for the Max-Cut Problem: A Cutting-Plane Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

2011

On the membership problem for the {0, 1/2}-closure.

[BibT_eX]

[DOI]

Sebastian Pokutta

Andreas S. Schulz

Oper. Res. Lett., 2011

Gap inequalities for non-convex mixed-integer quadratic programs.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2011

Generalized network design polyhedra.

[BibT_eX]

[DOI]

Corinne Feremans

Martine Labbé

Networks, 2011

Computing compatible tours for the symmetric traveling salesman problem.

[BibT_eX]

[DOI]

Math. Program. Comput., 2011

Decorous Lower Bounds for Minimum Linear Arrangement.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2011

A New Approach to the Stable Set Problem Based on Ellipsoids.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatoral Optimization, 2011

2010

Small bipartite subgraph polytopes.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2010

Separation algorithms for 0-1 knapsack polytopes.

[BibT_eX]

[DOI]

Math. Program., 2010

New techniques for cost sharing in combinatorial optimization games.

[BibT_eX]

[DOI]

Math. Program., 2010

Lower Bounds for the Minimum Linear Arrangement of a Graph.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2010

Integer Quadratic Quasi-polyhedra.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2010

2009

General Routing Problem.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

On Nonconvex Quadratic Programming with Box Constraints.

[BibT_eX]

[DOI]

Samuel Burer

SIAM J. Optim., 2009

An application of the Lovász-Schrijver M(K, K) operator to the stable set problem.

[BibT_eX]

[DOI]

Math. Program., 2009

Exploiting sparsity in pricing routines for the capacitated arc routing problem.

[BibT_eX]

[DOI]

Amar Oukil

Comput. Oper. Res., 2009

2008

Odd Minimum Cut Sets and b-Matchings Revisited.

[BibT_eX]

[DOI]

Gerhard Reinelt

SIAM J. Discret. Math., 2008

Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem.

[BibT_eX]

[DOI]

André Renato Sales Amaral

Eur. J. Oper. Res., 2008

A New Lower Bound for the Minimum Linear Arrangement of a Graph.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2008

Exploiting planarity in separation routines for the symmetric traveling salesman problem.

[BibT_eX]

[DOI]

Nicholas A. Pearson

Discret. Optim., 2008

Preface.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2008

Good triangulations yield good tours.

[BibT_eX]

[DOI]

Nicholas A. Pearson

Comput. Oper. Res., 2008

2007

A branch-and-cut algorithm for the capacitated open vehicle routing problem.

[BibT_eX]

[DOI]

Jens Lysgaard

J. Oper. Res. Soc., 2007

Mixed integer programming.

[BibT_eX]

[DOI]

Jon Lee

Discret. Optim., 2007

The traveling salesman problem: a book review.

[BibT_eX]

[DOI]

4OR, 2007

2006

Projection results for vehicle routing.

[BibT_eX]

[DOI]

Math. Program., 2006

Exploring the Relationship Between Max-Cut and Stable Set Relaxations.

[BibT_eX]

[DOI]

Monia Giandomenico

Math. Program., 2006

Polynomial-Time Separation of a Superclass of Simple Comb Inequalities.

[BibT_eX]

[DOI]

Lisa Fleischer

Math. Oper. Res., 2006

Odd minimum cut sets and b-matchings revisited.

[BibT_eX]

[DOI]

CoRR, 2006

2005

A fast algorithm for minimum weight odd circuits and cuts in planar graphs.

[BibT_eX]

[DOI]

Nicholas A. Pearson

Oper. Res. Lett., 2005

2004

Book review.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2004

A new branch-and-cut algorithm for the capacitated vehicle routing problem.

[BibT_eX]

[DOI]

Jens Lysgaard

Math. Program., 2004

A Faster Exact Separation Algorithm for Blossom Inequalities.

[BibT_eX]

[DOI]

Gerhard Reinelt

Proceedings of the Integer Programming and Combinatorial Optimization, 2004

2003

Binary clutter inequalities for integer programs.

[BibT_eX]

[DOI]

Math. Program., 2003

On the separation of split cuts and related inequalities.

[BibT_eX]

[DOI]

Math. Program., 2003

Primal separation algorithms.

[BibT_eX]

[DOI]

4OR, 2003

2002

Strengthening Chvátal-Gomory cuts and Gomory fractional cuts.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2002

Totally tight Chvátal-Gomory cuts.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2002

Multistars, partial multistars and the capacitated vehicle routing problem.

[BibT_eX]

[DOI]

Jens Lysgaard

Math. Program., 2002

Primal cutting plane algorithms revisited.

[BibT_eX]

[DOI]

Math. Methods Oper. Res., 2002

Approximation Algorithms.

[BibT_eX]

[DOI]

J. Oper. Res. Soc., 2002

Polynomial-Time Separation of Simple Comb Inequalities.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2002

2001

A cutting plane algorithm for the General Routing Problem.

[BibT_eX]

[DOI]

Angel Corberán

José María Sanchis

Math. Program., 2001

On Disjunctive Cuts for Combinatorial Optimization.

[BibT_eX]

[DOI]

J. Comb. Optim., 2001

Analysis of upper bounds for the Pallet Loading Problem.

[BibT_eX]

[DOI]

André Renato Sales Amaral

Eur. J. Oper. Res., 2001

An Augment-and-Branch-and-Cut Framework for Mixed 0-1 Programming.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization, 2001

2000

On the separation of maximally violated mod- k cuts.

[BibT_eX]

[DOI]

Matteo Fischetti

Math. Program., 2000

Separating a Superclass of Comb Inequalities in Planar Graphs.

[BibT_eX]

[DOI]

Math. Oper. Res., 2000

1999

The general routing polyhedron: A unifying framework.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 1999

On the Separation of Maximally Violated mod-k Cuts.

[BibT_eX]

[DOI]

Matteo Fischetti

Proceedings of the Integer Programming and Combinatorial Optimization, 1999

1998

The rural postman problem with deadline classes.

[BibT_eX]

[DOI]