The following pages link to Adam N. Letchford (Q185370):
Displaying 50 items.
- New valid inequalities for the fixed-charge and single-node flow polytopes (Q2294335) (← links)
- A new separation algorithm for the Boolean quadric and cut polytopes (Q2339832) (← links)
- Cutting planes for RLT relaxations of mixed 0-1 polynomial programs (Q2349139) (← links)
- Good triangulations yield good tours (Q2384914) (← links)
- An application of the Lovász-Schrijver \(M(K, K)\) operator to the stable set problem (Q2390997) (← links)
- A note on the 2-circulant inequalities for the MAX-cut problem (Q2417185) (← links)
- Unbounded convex sets for non-convex mixed-integer quadratic programming (Q2436643) (← links)
- A compact variant of the QCR method for quadratically constrained quadratic \(0-1\) programs (Q2448194) (← links)
- Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem (Q2462108) (← links)
- Exploring the relationship between max-cut and stable set relaxations (Q2490329) (← links)
- An aggressive reduction scheme for the simple plant location problem (Q2514768) (← links)
- Projection results for vehicle routing (Q2583125) (← links)
- New techniques for cost sharing in combinatorial optimization games (Q2638367) (← links)
- Separation algorithms for 0-1 knapsack polytopes (Q2638369) (← links)
- Lifting the knapsack cover inequalities for the knapsack polytope (Q2661529) (← links)
- Using \(\ell^p\)-norms for fairness in combinatorial optimisation (Q2664297) (← links)
- The stable set problem: clique and nodal inequalities revisited (Q2664356) (← links)
- Vehicle routing on road networks: how good is Euclidean approximation? (Q2668618) (← links)
- Generalised 2-circulant inequalities for the max-cut problem (Q2670485) (← links)
- A cut-and-branch algorithm for the quadratic knapsack problem (Q2673234) (← links)
- Separating a superclass of comb inequalities in planar graphs (Q2757646) (← links)
- Strengthening Chvátal-Gomory Cuts for the Stable Set Problem (Q2835677) (← links)
- Lower bounds for the minimum linear arrangement of a graph (Q2861498) (← links)
- Decorous lower bounds for minimum linear arrangement (Q2899100) (← links)
- Iterated Chvátal--Gomory Cuts and the Geometry of Numbers (Q2934479) (← links)
- Ellipsoidal Relaxations of the Stable Set Problem: Theory and Algorithms (Q2949518) (← links)
- A Dynamic Programming Heuristic for the Quadratic Knapsack Problem (Q2967622) (← links)
- A New Approach to the Stable Set Problem Based on Ellipsoids (Q3009765) (← links)
- Generalized network design polyhedra (Q3100692) (← links)
- Gap Inequalities for the Max-Cut Problem: A Cutting-Plane Algorithm (Q3167623) (← links)
- Detecting Changes in Slope With an <i><i>L</i><sub>0</sub></i> Penalty (Q3391229) (← links)
- A New Lower Bound for the Minimum Linear Arrangement of a Graph (Q3503534) (← links)
- Binary Positive Semidefinite Matrices and Associated Integer Polytopes (Q3503844) (← links)
- On Nonconvex Quadratic Programming with Box Constraints (Q3563922) (← links)
- Integer Quadratic Quasi-polyhedra (Q3569823) (← links)
- Odd Minimum Cut Sets and <i>b</i>-Matchings Revisited (Q3648510) (← links)
- (Q4263704) (← links)
- (Q4414642) (← links)
- A guide to conic optimisation and its applications (Q4634309) (← links)
- (Q4737521) (← links)
- (Q4762467) (← links)
- Allocation of School Bus Contracts By Integer Programming (Q4887712) (← links)
- The Boolean Quadric Polytope (Q5050144) (← links)
- Polynomial-Time Separation of a Superclass of Simple Comb Inequalities (Q5388004) (← links)
- Integer Programming and Combinatorial Optimization (Q5712453) (← links)
- A cutting plane algorithm for the general routing problem (Q5935711) (← links)
- Analysis of upper bounds for the pallet loading problem (Q5939589) (← links)
- On disjunctive cuts for combinatorial optimization (Q5952319) (← links)
- On some lower bounds for the permutation flowshop problem (Q6047866) (← links)
- Matheuristics: survey and synthesis (Q6056873) (← links)
