Pages that link to "Item:Q3911684"
From MaRDI portal
The following pages link to A restricted Lagrangean approach to the traveling salesman problem (Q3911684):
Displaying 50 items.
- Nonlinear resolving functions for the travelling salesman problem (Q462011) (← links)
- Approximate algorithms for the traveling salesman problem. II (Q499569) (← links)
- A diagonal completion and 2-optimal procedure for the travelling salesman problem (Q583126) (← links)
- A branch and bound algorithm for the capacitated vehicle routing problem (Q585095) (← links)
- Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times (Q631908) (← links)
- The multiple-robot assembly plan problem (Q685191) (← links)
- On dual solutions of the linear assignment problem (Q761971) (← links)
- Transforming asymmetric into symmetric traveling salesman problems (Q787877) (← links)
- Recent trends in combinatorial optimization (Q788638) (← links)
- Non delayed relax-and-cut algorithms (Q817212) (← links)
- A branch and bound algorithm for the one-machine scheduling problem with minimum and maximum time lags (Q872246) (← links)
- Discrete optimization by optimal control methods. III. The dynamic traveling salesman problem (Q885705) (← links)
- Maximum travelling salesman problem. I (Q891481) (← links)
- Lower bounds for the symmetric travelling salesman problem from Lagrangean relaxations (Q908860) (← links)
- On the stochastic complexity of the asymmetric traveling salesman problem (Q915656) (← links)
- A production planning problem in FMS (Q917423) (← links)
- New lower bounds for the triplanar assignment problem. Use of the classical model (Q1003082) (← links)
- An algorithm for the traveling salesman problem with pickup and delivery customers (Q1071656) (← links)
- An inexact algorithm for the sequential ordering problem (Q1108187) (← links)
- An additive bounding procedure for the asymmetric travelling salesman problem (Q1184344) (← links)
- Travelling salesman problem tools for microcomputers (Q1184464) (← links)
- The traveling salesman problem: An overview of exact and approximate algorithms (Q1194761) (← links)
- Analysis of the Held-Karp lower bound for the asymmetric TSP (Q1200770) (← links)
- New edges not used in shortest tours of TSP (Q1291639) (← links)
- Minimum directed 1-subtree relaxation for score orienteering problem (Q1291640) (← links)
- Heuristics for the flow line problem with setup costs (Q1303708) (← links)
- A set covering reformulation of the pure fixed charge transportation problem (Q1317046) (← links)
- Analyzing tradeoffs between zonal constraints and accessibility in facility location (Q1317094) (← links)
- Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems (Q1580967) (← links)
- Cluster based branching for the asymmetric traveling salesman problem (Q1806732) (← links)
- Heuristic methods and applications: A categorized survey (Q1823879) (← links)
- New lower bounds for the symmetric travelling salesman problem (Q1824572) (← links)
- Lagrangean relaxation. (With comments and rejoinder). (Q1876461) (← links)
- The symmetric travelling salesman problem. II: New low bounds (Q1956919) (← links)
- Reduced first-level representations via the reformulation-linearization technique: Results, counterexamples, and computations (Q1975377) (← links)
- Facets of the three-index assignment polytope (Q2276881) (← links)
- Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs (Q2384394) (← links)
- Dynamic bundle methods (Q2390994) (← links)
- The three-dimensional assignment and partition problems. New lower bounds (Q2457504) (← links)
- Discrete optimization by optimal control methods. II: The static traveling salesman problem (Q2457582) (← links)
- A relax-and-cut algorithm for the set partitioning problem (Q2462542) (← links)
- Decomposition and dynamic cut generation in integer linear programming (Q2490337) (← links)
- Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition (Q2583135) (← links)
- The symmetric travelling salesman problem. I: New fast lower bounds for the problem of optimal 2-matching (Q2654962) (← links)
- Exact algorithms for the vertex separator problem in graphs (Q3008917) (← links)
- Better assignment lower bounds for the Euclidean traveling salesman problem (Q3771999) (← links)
- Some facets of the simple plant location polytope (Q3945954) (← links)
- Shuffling heuristics for the storage location assignment in an AS/RS (Q4399000) (← links)
- A Lagrangian relaxation approach to the edge-weighted clique problem (Q5937353) (← links)
- Matheuristics: survey and synthesis (Q6056873) (← links)
