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)

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
Combining probabilistic algorithms, constraint programming and Lagrangian relaxation to solve the vehicle routing problem
Dual formulations and subgradient optimization strategies for linear programming relaxations of mixed-integer programs
Match twice and stitch: a new TSP tour construction heuristic.
A restricted Lagrangean approach to the traveling salesman problem
An exact algorithm for side-chain placement in protein design
Topological design of computer communication networks -- the overall design problem
On efficient matheuristic algorithms for multi-period stochastic facility location-assignment problems
New lower bounds for the symmetric travelling salesman problem
Optimizing tabu list size for the traveling salesman problem
Improvements of the Held—Karp algorithm for the symmetric traveling-salesman problem
Minimum directed 1-subtree relaxation for score orienteering problem
An exact algorithm for the capacitated shortest spanning arborescence
A matroid algorithm and its application to the efficient solution of two optimization problems on graphs
The symmetric traveling salesman problem and edge exchanges in minimal 1- trees
Relaxed tours and path ejections for the traveling salesman problem
A lower bound for the breakpoint phylogeny problem
The traveling salesman problem: A duality approach
A decomposition heuristic for the maximal covering location problem
A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality
New filtering for \textsc{AtMostNValue} and its weighted variant: a Lagrangian approach
General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic
Lagrangean/surrogate relaxation for generalized assignment problems
Lineare Charakterisierungen von Travelling Salesman Problemen
Estimating the Held-Karp lower bound for the geometric TSP
Heuristically guided algorithm for k-parity matroid problems
A modified Lin--Kernighan traveling-salesman heuristic
Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times
An upper bound for the speedup of parallel best-bound branch-and-bound algorithms
Relaxation heuristics for a generalized assignment problem
A direct dual method for the mixed plant location problem with some side constraints
Bounds for 3-matroid intersection problems
Implementation analysis of efficient heuristic algorithms for the traveling salesman problem
Lower bounds for the symmetric travelling salesman problem from Lagrangean relaxations
A dual ascent algorithm for the 1-tree relaxation of the symmetric traveling salesman problem
An effective approach for optimization of a perishable inventory system with uncertainty in both demand and supply
Weighted matching as a generic pruning technique applied to optimization constraints
The travelling salesman problem and a class of polyhedra of diameter two
Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut
A bound for the symmetric travelling salesman problem through matroid formulation
Results from a parallel branch-and-bound algorithm for the asymmetric traveling salesman problem
On some difficult linear programs coming from set partitioning
An equivalent subproblem relaxation for improving the solution of a class of transportation scheduling problems
An additive bounding procedure for the asymmetric travelling salesman problem
A Lagrangian relaxation algorithm for sparse quadratic assignment problems
Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP
Nonoblivious 2-opt heuristics for the traveling salesman problem
Edge exchanges in the degree-constrained minimum spanning tree problem
An improvement in the Gavish-Shlifer algorithm for a class of transportation scheduling problems
Heuristics and their design: A survey
A class of convergent primal-dual subgradient algorithms for decomposable convex programs
Average-case analysis of best-first search in two representative directed acyclic graphs
Models and Lagrangian heuristics for a two-level lot-sizing problem with bounded inventory
Ergodic, primal convergence in dual subgradient schemes for convex programming. II: The case of inconsistent primal problems
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 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 Lagrangian-Based Algorithm for a Combinatorial Motion Planning 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

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)