Pages that link to "Item:Q3885519"
From MaRDI portal
The following pages link to Heuristic analysis, linear programming and branch and bound (Q3885519):
Displaying 50 items.
- Optimization procedures for the bipartite unconstrained 0-1 quadratic programming problem (Q337120) (← links)
- Approximation algorithms for inventory problems with submodular or routing costs (Q344939) (← links)
- Finding low cost TSP and 2-matching solutions using certain half-integer subtour vertices (Q408370) (← links)
- Shorter tours by nicer ears: \(7/5\)-approximation for the graph-TSP, \(3/2\) for the path version, and \(4/3\) for two-edge-connected subgraphs (Q484552) (← links)
- Deterministic sampling algorithms for network design (Q547282) (← links)
- Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION (Q679447) (← links)
- A note on the prize collecting traveling salesman problem (Q687042) (← links)
- Survivable networks, linear programming relaxations and the parsimonious property (Q689117) (← links)
- A minimum spanning tree based heuristic for the travelling salesman tour (Q724377) (← links)
- New semidefinite programming relaxations for the linear ordering and the traveling salesman problem (Q729796) (← links)
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects (Q817185) (← links)
- Network design with edge-connectivity and degree constraints (Q839639) (← links)
- Analyzing the Held-Karp TSP bound: A monotonicity property with application (Q912624) (← links)
- A Lagrangian-based algorithm for a multiple depot, multiple traveling salesmen problem (Q1026674) (← links)
- A new class of cutting planes for the symmetric travelling salesman problem (Q1107441) (← links)
- Heuristics and their design: A survey (Q1152854) (← links)
- An improved approximation ratio for the minimum latency problem (Q1290636) (← links)
- Estimating the Held-Karp lower bound for the geometric TSP (Q1291588) (← links)
- The parsimonious property of cut covering problems and its applications (Q1375118) (← links)
- On approximately fair cost allocation in Euclidean TSP games (Q1384221) (← links)
- The multidimensional 0-1 knapsack problem: an overview. (Q1428041) (← links)
- Approximation algorithms for connected graph factors of minimum weight (Q1743127) (← links)
- Online covering salesman problem (Q1743496) (← links)
- Improved integrality gap upper bounds for traveling salesperson problems with distances one and two (Q1754106) (← links)
- On the integrality ratio of the subtour LP for Euclidean TSP (Q1785291) (← links)
- Efficient constructions of convex combinations for 2-edge-connected subgraphs on fundamental classes (Q2067494) (← links)
- LP-based algorithms for multistage minimization problems (Q2117680) (← links)
- Matroid-based TSP rounding for half-integral solutions (Q2164710) (← links)
- Shorter tours and longer detours: uniform covers and a bit beyond (Q2220659) (← links)
- The salesman's improved tours for fundamental classes (Q2227538) (← links)
- Hard to solve instances of the Euclidean traveling salesman problem (Q2246186) (← links)
- \(\frac{13}{9}\)-approximation for graphic TSP (Q2254507) (← links)
- An improved upper bound on the integrality ratio for the \(s\)-\(t\)-path TSP (Q2294304) (← links)
- The traveling salesman problem on cubic and subcubic graphs (Q2452378) (← links)
- Optimal toll design: a lower bound framework for the asymmetric traveling salesman problem (Q2452379) (← links)
- An improved upper bound for the TSP in cubic 3-edge-connected graphs (Q2488197) (← links)
- A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem (Q2660410) (← links)
- Improving on best-of-many-Christofides for \(T\)-tours (Q2661569) (← links)
- Towards improving Christofides algorithm on fundamental classes by gluing convex combinations of tours (Q2687058) (← links)
- Fractional decomposition tree algorithm: a tool for studying the integrality gap of integer programs (Q2688462) (← links)
- Reassembling trees for the traveling salesman (Q2806177) (← links)
- Approximation algorithms for metric tree cover and generalized tour and tree covers (Q3004205) (← links)
- TSP on Cubic and Subcubic Graphs (Q3009751) (← links)
- Facility Location with Client Latencies: Linear Programming Based Techniques for Minimum Latency Problems (Q3009753) (← links)
- On some approximately balanced combinatorial cooperative games (Q3142154) (← links)
- (Q3191144) (← links)
- Approximation Limits of Linear Programs (Beyond Hierarchies) (Q3449458) (← links)
- Preprocessing composite cutting procedure: an approach to the integer model (Q3604028) (← links)
- An elementary survey of general duality theory in mathematical programming (Q3921006) (← links)
- The Unbounded Integrality Gap of a Semidefinite Relaxation of the Traveling Salesman Problem (Q4577740) (← links)
