The following pages link to Adam N. Letchford (Q185370):
Displaying 50 items.
- Compact formulations of the Steiner traveling salesman problem and related problems (Q257227) (← links)
- Stronger multi-commodity flow formulations of the capacitated vehicle routing problem (Q319445) (← links)
- The Steiner travelling salesman problem with correlated costs (Q319524) (← links)
- Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem (Q322625) (← links)
- Pricing routines for vehicle routing with time windows on road networks (Q337163) (← links)
- A polyhedral approach to the single row facility layout problem (Q378107) (← links)
- Gap inequalities for non-convex mixed-integer quadratic programs (Q408381) (← links)
- On the membership problem for the \({0, 1/2}\)-closure (Q408382) (← links)
- Complexity results for the gap inequalities for the max-cut problem (Q439900) (← links)
- Computing compatible tours for the symmetric traveling salesman problem (Q542055) (← links)
- On a class of metrics related to graph layout problems (Q603106) (← links)
- Small bipartite subgraph polytopes (Q613319) (← links)
- Binary positive semidefinite matrices and associated integer polytopes (Q662294) (← links)
- On matroid parity and matching polytopes (Q777400) (← links)
- A fast algorithm for minimum weight odd circuits and cuts in planar graphs (Q813970) (← links)
- Exploiting planarity in separation routines for the symmetric traveling salesman problem (Q951094) (← links)
- Exploiting sparsity in pricing routines for the capacitated arc routing problem (Q1013413) (← links)
- New inequalities for the general routing problem (Q1278493) (← links)
- The rural postman problem with deadline classes (Q1291753) (← links)
- Multistars, partial multistars and the capacitated vehicle routing problem (Q1396812) (← links)
- Primal cutting plane algorithms revisited (Q1396918) (← links)
- On the separation of split cuts and related inequalities (Q1411614) (← links)
- Primal separation algorithms (Q1416099) (← links)
- Binary clutter inequalities for integer programs (Q1424294) (← links)
- Totally tight Chvatal-Gomory cuts (Q1612006) (← links)
- Strengthening Chvátal-Gomory cuts and Gomory fractional cuts (Q1612007) (← links)
- A heuristic for maximising energy efficiency in an OFDMA system subject to QoS constraints (Q1661901) (← links)
- An exact algorithm for a resource allocation problem in mobile wireless communications (Q1687306) (← links)
- A note on representations of linear inequalities in non-convex mixed-integer quadratic programs (Q1728372) (← links)
- A two-level graph partitioning problem arising in mobile wireless communications (Q1744904) (← links)
- New valid inequalities and facets for the simple plant location problem (Q1749485) (← links)
- On the Lovász theta function and some variants (Q1751239) (← links)
- Projection results for the \(k\)-partition problem (Q1751250) (← links)
- Fast bounding procedures for large instances of the simple plant location problem (Q1762067) (← links)
- The general routing polyhedron: A unifying framework (Q1806888) (← links)
- A new branch-and-cut algorithm for the capacitated vehicle routing problem (Q1881569) (← links)
- On the separation of maximally violated mod-\(k\) cuts (Q1970294) (← links)
- The capacitated vehicle routing problem: stronger bounds in pseudo-polynomial time (Q1991101) (← links)
- On the complexity of surrogate and group relaxation for integer linear programs (Q2060595) (← links)
- Strengthened clique-family inequalities for the stable set polytope (Q2060608) (← links)
- A separation algorithm for the simple plant location problem (Q2060615) (← links)
- Revisiting surrogate relaxation for the multidimensional knapsack problem (Q2102833) (← links)
- Newsvendor problems: an integrated method for estimation and optimisation (Q2116868) (← links)
- Valid inequalities for mixed-integer programmes with fixed charges on sets of variables (Q2183195) (← links)
- Facets from gadgets (Q2220662) (← links)
- Valid inequalities for quadratic optimisation with domain constraints (Q2234747) (← links)
- Bi-perspective functions for mixed-integer fractional programs with indicator variables (Q2235139) (← links)
- Adaptive policies for perimeter surveillance problems (Q2286935) (← links)
- A binarisation heuristic for non-convex quadratic programming with box constraints (Q2294229) (← links)
- On lifted cover inequalities: a new lifting procedure with unusual properties (Q2294273) (← links)
