| Publication | Date of Publication | Type |
|---|
Mip-based local search for permutation flowshop scheduling with makespan objective
Computers & Operations Research | 2026-02-23 | Paper |
\texttt{CP-Lib}: benchmark instances of the clique partitioning problem
Mathematical Programming Computation | 2024-06-01 | Paper |
Improving a constructive heuristic for the general routing problem
Networks | 2023-12-18 | Paper |
A survey on exact algorithms for the maximum flow and minimum‐cost flow problems
Networks | 2023-12-18 | Paper |
Fast upper and lower bounds for a large‐scale real‐world arc routing problem
Networks | 2023-12-18 | Paper |
On matchings, T‐joins, and arc routing in road networks
Networks | 2023-12-11 | Paper |
Matheuristics: survey and synthesis
International Transactions in Operational Research | 2023-10-04 | Paper |
On some lower bounds for the permutation flowshop problem
Computers & Operations Research | 2023-09-13 | Paper |
Revisiting surrogate relaxation for the multidimensional knapsack problem
Operations Research Letters | 2022-12-12 | Paper |
The Boolean quadric polytope
The Quadratic Unconstrained Binary Optimization Problem | 2022-11-15 | Paper |
| Naive Newsvendor Adjustments: Are They Always Detrimental? | 2022-09-23 | Paper |
A cut-and-branch algorithm for the quadratic knapsack problem
Discrete Optimization | 2022-06-09 | Paper |
Detecting Changes in Slope With an L0 Penalty
Journal of Computational and Graphical Statistics | 2022-03-28 | Paper |
Newsvendor problems: an integrated method for estimation and optimisation
European Journal of Operational Research | 2022-03-18 | Paper |
Generalised 2-circulant inequalities for the max-cut problem
Operations Research Letters | 2022-03-11 | Paper |
Vehicle routing on road networks: how good is Euclidean approximation?
Computers & Operations Research | 2022-03-07 | Paper |
A separation algorithm for the simple plant location problem
Operations Research Letters | 2021-12-13 | Paper |
On the complexity of surrogate and group relaxation for integer linear programs
Operations Research Letters | 2021-12-13 | Paper |
Strengthened clique-family inequalities for the stable set polytope
Operations Research Letters | 2021-12-13 | Paper |
Bi-perspective functions for mixed-integer fractional programs with indicator variables
Mathematical Programming. Series A. Series B | 2021-10-20 | Paper |
Valid inequalities for quadratic optimisation with domain constraints
Discrete Optimization | 2021-10-19 | Paper |
Using \(\ell^p\)-norms for fairness in combinatorial optimisation
Computers & Operations Research | 2021-04-20 | Paper |
The stable set problem: clique and nodal inequalities revisited
Computers & Operations Research | 2021-04-20 | Paper |
Lifting the knapsack cover inequalities for the knapsack polytope
Operations Research Letters | 2021-04-07 | Paper |
Facets from gadgets
Mathematical Programming. Series A. Series B | 2021-01-25 | Paper |
On matroid parity and matching polytopes
Discrete Applied Mathematics | 2020-07-07 | Paper |
Valid inequalities for mixed-integer programmes with fixed charges on sets of variables
Operations Research Letters | 2020-05-26 | Paper |
On lifted cover inequalities: a new lifting procedure with unusual properties
Operations Research Letters | 2020-02-10 | Paper |
New valid inequalities for the fixed-charge and single-node flow polytopes
Operations Research Letters | 2020-02-10 | Paper |
A binarisation heuristic for non-convex quadratic programming with box constraints
Operations Research Letters | 2020-02-10 | Paper |
Adaptive policies for perimeter surveillance problems
European Journal of Operational Research | 2020-01-23 | Paper |
A note on the 2-circulant inequalities for the MAX-cut problem
Operations Research Letters | 2019-06-11 | Paper |
A guide to conic optimisation and its applications
RAIRO - Operations Research | 2019-05-07 | Paper |
A note on representations of linear inequalities in non-convex mixed-integer quadratic programs
Operations Research Letters | 2019-02-22 | Paper |
The capacitated vehicle routing problem: stronger bounds in pseudo-polynomial time
European Journal of Operational Research | 2018-10-30 | Paper |
| A heuristic for maximising energy efficiency in an OFDMA system subject to QoS constraints | 2018-08-17 | Paper |
Projection results for the \(k\)-partition problem
Discrete Optimization | 2018-05-24 | Paper |
On the Lovász theta function and some variants
Discrete Optimization | 2018-05-24 | Paper |
New valid inequalities and facets for the simple plant location problem
European Journal of Operational Research | 2018-05-17 | Paper |
A two-level graph partitioning problem arising in mobile wireless communications
Computational Optimization and Applications | 2018-04-20 | Paper |
An exact algorithm for a resource allocation problem in mobile wireless communications
Computational Optimization and Applications | 2017-12-22 | Paper |
A dynamic programming heuristic for the quadratic knapsack problem
INFORMS Journal on Computing | 2017-03-01 | Paper |
Strengthening Chvátal-Gomory cuts for the stable set problem
Lecture Notes in Computer Science | 2016-11-30 | Paper |
Pricing routines for vehicle routing with time windows on road networks
Computers & Operations Research | 2016-11-10 | Paper |
Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem
European Journal of Operational Research | 2016-10-07 | Paper |
Stronger multi-commodity flow formulations of the capacitated vehicle routing problem
European Journal of Operational Research | 2016-10-06 | Paper |
The Steiner travelling salesman problem with correlated costs
European Journal of Operational Research | 2016-10-06 | Paper |
Compact formulations of the Steiner traveling salesman problem and related problems
European Journal of Operational Research | 2016-03-15 | Paper |
Ellipsoidal relaxations of the stable set problem: theory and algorithms
SIAM Journal on Optimization | 2015-10-01 | Paper |
Cutting planes for RLT relaxations of mixed 0-1 polynomial programs
Mathematical Programming. Series A. Series B | 2015-06-19 | Paper |
A new separation algorithm for the Boolean quadric and cut polytopes
Discrete Optimization | 2015-04-09 | Paper |
An aggressive reduction scheme for the simple plant location problem
European Journal of Operational Research | 2015-02-03 | Paper |
Iterated Chvátal-Gomory cuts and the geometry of numbers
SIAM Journal on Optimization | 2014-12-12 | Paper |
Iterated Chvátal-Gomory cuts and the geometry of numbers
SIAM Journal on Optimization | 2014-12-12 | Paper |
A compact variant of the QCR method for quadratically constrained quadratic \(0-1\) programs
Optimization Letters | 2014-04-30 | Paper |
Unbounded convex sets for non-convex mixed-integer quadratic programming
Mathematical Programming. Series A. Series B | 2014-02-25 | Paper |
A polyhedral approach to the single row facility layout problem
Mathematical Programming. Series A. Series B | 2013-11-11 | Paper |
| Lower bounds for the minimum linear arrangement of a graph | 2013-11-08 | Paper |
Fast bounding procedures for large instances of the simple plant location problem
Computers & Operations Research | 2012-11-15 | Paper |
Gap inequalities for the max-cut problem: a cutting-plane algorithm
Lecture Notes in Computer Science | 2012-11-02 | Paper |
Complexity results for the gap inequalities for the max-cut problem
Operations Research Letters | 2012-08-17 | Paper |
Decorous lower bounds for minimum linear arrangement
INFORMS Journal on Computing | 2012-07-28 | Paper |
Gap inequalities for non-convex mixed-integer quadratic programs
Operations Research Letters | 2012-04-05 | Paper |
On the membership problem for the \({0, 1/2}\)-closure
Operations Research Letters | 2012-04-05 | Paper |
Binary positive semidefinite matrices and associated integer polytopes
Mathematical Programming. Series A. Series B | 2012-02-22 | Paper |
Generalized network design polyhedra
Networks | 2011-11-21 | Paper |
A new approach to the stable set problem based on ellipsoids
Integer Programming and Combinatoral Optimization | 2011-06-24 | Paper |
Computing compatible tours for the symmetric traveling salesman problem
Mathematical Programming Computation | 2011-06-08 | Paper |
Small bipartite subgraph polytopes
Operations Research Letters | 2010-12-20 | Paper |
On a class of metrics related to graph layout problems
Linear Algebra and its Applications | 2010-11-05 | Paper |
On a class of metrics related to graph layout problems
Linear Algebra and its Applications | 2010-11-05 | Paper |
Separation algorithms for 0-1 knapsack polytopes
Mathematical Programming. Series A. Series B | 2010-09-16 | Paper |
New techniques for cost sharing in combinatorial optimization games
Mathematical Programming. Series A. Series B | 2010-09-16 | Paper |
Integer quadratic quasi-polyhedra
Integer Programming and Combinatorial Optimization | 2010-06-22 | Paper |
On nonconvex quadratic programming with box constraints
SIAM Journal on Optimization | 2010-06-01 | Paper |
Odd Minimum Cut Sets and b-Matchings Revisited
SIAM Journal on Discrete Mathematics | 2009-11-27 | Paper |
An application of the Lovász-Schrijver \(M(K, K)\) operator to the stable set problem
Mathematical Programming. Series A. Series B | 2009-07-24 | Paper |
Exploiting sparsity in pricing routines for the capacitated arc routing problem
Computers & Operations Research | 2009-04-17 | Paper |
Exploiting planarity in separation routines for the symmetric traveling salesman problem
Discrete Optimization | 2008-10-29 | Paper |
Binary Positive Semidefinite Matrices and Associated Integer Polytopes
Integer Programming and Combinatorial Optimization | 2008-06-10 | Paper |
A New Lower Bound for the Minimum Linear Arrangement of a Graph
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
Polynomial-Time Separation of a Superclass of Simple Comb Inequalities
Mathematics of Operations Research | 2008-05-27 | Paper |
Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem
European Journal of Operational Research | 2007-11-23 | Paper |
Good triangulations yield good tours
Computers & Operations Research | 2007-10-10 | Paper |
Exploring the relationship between max-cut and stable set relaxations
Mathematical Programming. Series A. Series B | 2006-05-02 | Paper |
A fast algorithm for minimum weight odd circuits and cuts in planar graphs
Operations Research Letters | 2006-02-02 | Paper |
Projection results for vehicle routing
Mathematical Programming. Series A. Series B | 2006-01-13 | Paper |
Integer Programming and Combinatorial Optimization
Lecture Notes in Computer Science | 2005-12-23 | Paper |
A new branch-and-cut algorithm for the capacitated vehicle routing problem
Mathematical Programming. Series A. Series B | 2004-10-05 | Paper |
| scientific article; zbMATH DE number 2086916 (Why is no real title available?) | 2004-08-11 | Paper |
Binary clutter inequalities for integer programs
Mathematical Programming. Series A. Series B | 2004-03-11 | Paper |
On the separation of split cuts and related inequalities
Mathematical Programming. Series A. Series B | 2003-10-29 | Paper |
| scientific article; zbMATH DE number 1953196 (Why is no real title available?) | 2003-07-25 | Paper |
Primal cutting plane algorithms revisited
Mathematical Methods of Operations Research | 2003-07-14 | Paper |
Multistars, partial multistars and the capacitated vehicle routing problem
Mathematical Programming. Series A. Series B | 2003-07-13 | Paper |
Primal separation algorithms
4OR | 2003-01-01 | Paper |
Strengthening Chvátal-Gomory cuts and Gomory fractional cuts
Operations Research Letters | 2002-08-28 | Paper |
Totally tight Chvatal-Gomory cuts
Operations Research Letters | 2002-08-28 | Paper |
A cutting plane algorithm for the general routing problem
Mathematical Programming. Series A. Series B | 2002-08-07 | Paper |
Separating a superclass of comb inequalities in planar graphs
Mathematics of Operations Research | 2001-11-26 | Paper |
| scientific article; zbMATH DE number 1568940 (Why is no real title available?) | 2001-10-21 | Paper |
On the separation of maximally violated mod-\(k\) cuts
Mathematical Programming. Series A. Series B | 2001-05-02 | Paper |
| scientific article; zbMATH DE number 1342122 (Why is no real title available?) | 2001-03-04 | Paper |
The rural postman problem with deadline classes
European Journal of Operational Research | 2001-02-22 | Paper |
Analysis of upper bounds for the pallet loading problem
European Journal of Operational Research | 2001-01-01 | Paper |
On disjunctive cuts for combinatorial optimization
Journal of Combinatorial Optimization | 2001-01-01 | Paper |
The general routing polyhedron: A unifying framework
European Journal of Operational Research | 1999-11-08 | Paper |
New inequalities for the general routing problem
European Journal of Operational Research | 1999-02-22 | Paper |
Allocation of School Bus Contracts By Integer Programming
The Journal of the Operational Research Society | 1996-08-05 | Paper |
Operational Research: Methods and Applications
(available as arXiv preprint) | N/A | Paper |
