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

Cites work

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

Cited in

(only showing first 100 items - show all)

Upper bounds and exact algorithms for \(p\)-dispersion problems
The Lagrangian relaxation for the combinatorial integral approximation problem
Further results on the probabilistic traveling salesman problem
Natalie 2.0: sparse global network alignment as a special case of quadratic assignment
Symmetric weight constrained traveling salesman problem: Local search
An homage to Joseph-Louis Lagrange and Pierre Huard
Integer programming approaches to the travelling salesman problem
The seriation problem and the travelling salesman problem
Survivable networks, linear programming relaxations and the parsimonious property
On the integrality ratio for tree augmentation
Mapping tree-structured combinatorial optimization problems onto parallel computers
A path relinking approach with ejection chains for the generalized assignment problem
A new warmstarting strategy for the primal-dual column generation method
The salesman and the tree: the importance of search in CP
A Lagrangian-based algorithm for a combinatorial motion planning problem
Using cutting planes to solve the symmetric Travelling Salesman problem
Constrained 0-1 quadratic programming: basic approaches and extensions
On common edges in optimal solutions to traveling salesman and other optimization problems
Models, relaxations and exact approaches for the capacitated vehicle routing problem
Collapsing Superstring Conjecture
Some aspects of integer programming duality
Bounds for the symmetric 2-peripatetic salesman problem
A heuristic algorithm for the set covering problem
Combining probabilistic algorithms, constraint programming and Lagrangian relaxation to solve the vehicle routing 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
Improved filtering for weighted circuit constraints
Match twice and stitch: a new TSP tour construction heuristic.
Dual formulations and subgradient optimization strategies for linear programming relaxations of mixed-integer programs
The omnipresence of Lagrange
Application of Lagrangian relaxation to computer network control
Some problems in discrete optimization
A restricted Lagrangean approach to the traveling salesman problem
Lagrangian heuristic for simultaneous subsidization and penalization: implementations on rooted travelling salesman games
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
An exact algorithm for side-chain placement in protein design
Edge-disjoint spanning trees and the number of maximum state circles of a graph
Approximating asymmetric TSP in exponential time
Topological design of computer communication networks -- the overall design problem
Scenario cluster decomposition of the Lagrangian dual in two-stage stochastic mixed 0-1 optimization
On efficient matheuristic algorithms for multi-period stochastic facility location-assignment problems
Embedding learning capability in Lagrangean relaxation: an application to the travelling salesman problem
An MDD-Based Lagrangian Approach to the Multicommodity Pickup-and-Delivery TSP
An algorithm for the traveling salesman problem with pickup and delivery customers
Continuous relaxations for the traveling salesman problem
Optimizing tabu list size for the traveling salesman problem
The traveling salesman problem: An overview of exact and approximate algorithms
New lower bounds for the symmetric travelling salesman problem
Solution of a tinned iron purchasing problem by Lagrangean relaxation
Minimum directed 1-subtree relaxation for score orienteering problem
Constrained spanning trees and the traveling salesman problem
Computing assortative mixing by degree with the s-metric in networks using linear programming
Improvements of the Held—Karp algorithm for the symmetric traveling-salesman problem
A dual algorithm for the one-machine scheduling 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
Computational efficiency of the simplex embedding method in convex nondifferentiable optimization
The symmetric traveling salesman problem and edge exchanges in minimal 1- trees
About Lagrangian methods in integer optimization
New variants of bundle methods
Relaxed tours and path ejections for the traveling salesman problem
A lower bound for the breakpoint phylogeny problem
Lagrangian heuristics for the quadratic knapsack problem
A decomposition heuristic for the maximal covering location problem
A hybrid Lagrangean heuristic with GRASP and path-relinking for set k-covering
A Lagrangian relaxation approach for the multiple sequence alignment problem
Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem
The traveling salesman problem: A duality approach
A Survey of the Generalized Assignment Problem and Its Applications
The vehicle rescheduling problem with retiming
Certification of an optimal TSP tour through 85,900 cities
A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality
A Lagrangian-based algorithm for a multiple depot, multiple traveling salesmen problem
New filtering for \textsc{AtMostNValue} and its weighted variant: a Lagrangian approach
General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic
Incorporating facet-inducing inequalities into graphical-construct-based Lagrangian relaxation methodologies
A branch and bound algorithm for the capacitated vehicle routing problem
Lower bounding procedure for the asymmetric quadratic traveling salesman problem
Cluster Lagrangean decomposition in multistage stochastic optimization
The combinatorial bandwidth packing problem
A branch-and-bound approach for a vehicle routing problem with customer costs
Lagrangean/surrogate relaxation for generalized assignment problems
Generalized spanning trees
Dynamic programming algorithms and Lagrangian lower bounds for a discrete lot streaming problem in a two-machine flow shop
Coordination mechanisms with mathematical programming models for decentralized decision-making: a literature review
Polyhedral proof methods in combinatorial optimization
Solving capacitated clustering problems
Estimating the Held-Karp lower bound for the geometric TSP
Heuristically guided algorithm for k-parity matroid problems
Scenario cluster Lagrangean decomposition for risk averse in multistage stochastic optimization
Lineare Charakterisierungen von Travelling Salesman Problemen
The \(p\)-Lagrangian relaxation for separable nonconvex MIQCQP problems
Upper and lower bounds for the single source capacitated location problem.
Simultaneously exploiting two formulations: an exact Benders decomposition approach
A heuristic decomposition approach to optimal control in a water supply model
A modified Lin--Kernighan traveling-salesman heuristic
Optimizing production capacity and safety stocks in general acyclic supply chains

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)