The traveling-salesman problem and minimum spanning trees: Part II

Cites Work

On the shortest spanning subtree of a graph and the traveling salesman problem
A note on two problems in connexion with graphs
A Dynamic Programming Approach to Sequencing Problems
The Traveling-Salesman Problem and Minimum Spanning Trees
The Relaxation Method for Linear Inequalities
The Relaxation Method for Linear Inequalities
Computer Solutions of the Traveling Salesman Problem
Optimal assignments in an ordered set: An application of matroid theory
The Traveling Salesman Problem: A Survey

Cited In (only showing first 100 items - show all)

Upper bounds and exact algorithms for \(p\)-dispersion problems
Further results on the probabilistic traveling salesman problem
A path relinking approach with ejection chains for the generalized assignment problem
On the integrality ratio for tree augmentation
A Lagrangian-based algorithm for a combinatorial motion planning problem
A new warmstarting strategy for the primal-dual column generation method
The salesman and the tree: the importance of search in CP
Constrained 0-1 quadratic programming: basic approaches and extensions
Bounds for the symmetric 2-peripatetic salesman problem
Models, relaxations and exact approaches for the capacitated vehicle routing problem
The omnipresence of Lagrange
Improved filtering for weighted circuit constraints
Optimization of a 532-city symmetric traveling salesman problem by branch and cut
A Lagrangean approach to the degree-constrained minimum spanning tree problem
Optimal capacitated ring trees
A cross-decomposition scheme with integrated primal-dual multi-cuts for two-stage stochastic programming investment planning problems
Scenario cluster decomposition of the Lagrangian dual in two-stage stochastic mixed 0-1 optimization
Embedding learning capability in Lagrangean relaxation: an application to the travelling salesman problem
An algorithm for the traveling salesman problem with pickup and delivery customers
The traveling salesman problem: An overview of exact and approximate algorithms
A dual algorithm for the one-machine scheduling problem
Lagrangean Relaxation-Based Techniques for Solving Facility Location Problems
Computing assortative mixing by degree with the \(s\)-metric in networks using linear programming
About Lagrangian methods in integer optimization
New variants of bundle methods
A Survey of the Generalized Assignment Problem and Its Applications
A hybrid Lagrangean heuristic with GRASP and path-relinking for set \(k\)-covering
Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem
Certification of an optimal TSP tour through 85,900 cities
A Lagrangian-based algorithm for a multiple depot, multiple traveling salesmen problem
A branch and bound algorithm for the capacitated vehicle routing problem
Lower bounding procedure for the asymmetric quadratic traveling salesman problem
The combinatorial bandwidth packing problem
Cluster Lagrangean decomposition in multistage stochastic optimization
Generalized spanning trees
Polyhedral proof methods in combinatorial optimization
Solving capacitated clustering problems
Scenario cluster Lagrangean decomposition for risk averse in multistage stochastic optimization
Upper and lower bounds for the single source capacitated location problem.
Comparison of bundle and classical column generation
A language and a program for stating and solving combinatorial problems
Real-time vehicle rerouting problems with time windows
Heuristics and reduction methods for multiple constraints 0-1 linear programming problems
An exact algorithm for general, orthogonal, two-dimensional knapsack problems
Lagrangian decomposition for large-scale two-stage stochastic mixed 0-1 problems
A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation
Surrogate duality relaxation for job shop scheduling
Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem
Investigation of optimization methods and their applications
How to find Steiner minimal trees in Euclidean \(d\)-space
Lagrangean relaxation. (With comments and rejoinder).
Classification of travelling salesman problem formulations
A cross entropy-lagrangean hybrid algorithm for the multi-item capacitated lot-sizing problem with setup times
Solving the shortest route cut and fill problem using simulated annealing
On convergence rates of subgradient optimization methods
Hub-and-spoke network design and fleet deployment for string planning of liner shipping
Solving the anti-covering location problem using Lagrangian relaxation
The symmetric clustered traveling salesman problem
Transforming asymmetric into symmetric traveling salesman problems
Certifying algorithms
The multidimensional 0-1 knapsack problem: an overview.
Solution of large-scale symmetric travelling salesman problems
Airline crew scheduling: state-of-the-art
The multiple depot, multiple traveling salesmen facility-location problem: Vehicle range, service frequency, and heuristic implementations
On the choice of step size in subgradient optimization
The quadratic knapsack problem -- a survey
The simple plant location problem: Survey and synthesis
Lagrangean decompositions for the unconstrained binary quadratic programming problem
Experiments with LAGRASP heuristic for set \(k\)-covering
Construction heuristics for the asymmetric TSP.
Large traveling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computation
Minmax combinatorial optimization
A hybrid approach of bundle and Benders applied large mixed linear integer problem
The multicovering problem
Procedures for travelling salesman problems with additional constraints
Plant location with minimum inventory
Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
Parallel machine scheduling with earliness--tardiness penalties and additional resource con\-straints.
Cut-and-solve: An iterative search strategy for combinatorial optimization problems
Formulations and exact algorithms for the vehicle routing problem with time windows
An effective implementation of the Lin-Kernighan traveling salesman heuristic
Designing and reporting on computational experiments with heuristic methods
A Lagrangian heuristic for a train-unit assignment problem
A system for priority routing and capacity assignment in packet switched networks
A proximal cutting plane method using Chebychev center for nonsmooth convex optimization
A variable target value method for nondifferentiable optimization
Lagrangean relaxation with clusters for point-feature cartographic label placement problems
The selection and scheduling of telecommunication calls with time windows
A 3-flip neighborhood local search for the set covering problem
A technique for speeding up the solution of the Lagrangean dual
Validation of subgradient optimization
The Lagrangian relaxation for the combinatorial integral approximation problem
Integer programming approaches to the travelling salesman problem
Symmetric weight constrained traveling salesman problem: Local search
An homage to Joseph-Louis Lagrange and Pierre Huard
Survivable networks, linear programming relaxations and the parsimonious property
Using cutting planes to solve the symmetric Travelling Salesman problem
A heuristic algorithm for the set covering problem
An application-oriented guide for designing Lagrangean dual ascent algorithms
A characterization of linear admissible transformations for the m- travelling salesmen problem: A result of Berenguer

This page was built for publication: The traveling-salesman problem and minimum spanning trees: Part II

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5641007)