Pages that link to "Item:Q5633847"

The following pages link to The Traveling-Salesman Problem and Minimum Spanning Trees (Q5633847):

Displaying 50 items.

• A decomposition method for large scale MILPs, with performance guarantees and a power system application (Q259426) (← links)
• Duality for mixed-integer convex minimization (Q304264) (← links)
• Computing assortative mixing by degree with the \(s\)-metric in networks using linear programming (Q305479) (← links)
• Lower bounding procedure for the asymmetric quadratic traveling salesman problem (Q323214) (← links)
• A hybrid Lagrangean heuristic with GRASP and path-relinking for set \(k\)-covering (Q336718) (← links)
• Lower bounds for the quadratic minimum spanning tree problem based on reduced cost computation (Q342082) (← links)
• A hybrid approach of bundle and Benders applied large mixed linear integer problem (Q364462) (← links)
• A simple LP relaxation for the asymmetric traveling salesman problem (Q378136) (← links)
• Improved semidefinite programming bounds for quadratic assignment problems with suitable symmetry (Q431008) (← links)
• An exact algorithm to minimize the makespan in project scheduling with scarce resources and generalized precedence relations (Q439614) (← links)
• Exact hybrid algorithms for solving a bi-objective vehicle routing problem (Q441036) (← links)
• Nonlinear resolving functions for the travelling salesman problem (Q462011) (← links)
• Spanning closed walks and TSP in 3-connected planar graphs (Q462924) (← links)
• Certifying algorithms (Q465678) (← links)
• Improved parameterized algorithms for minimum link-length rectilinear spanning path problem (Q477189) (← links)
• Improved filtering for weighted circuit constraints (Q487627) (← links)
• Weighted matching as a generic pruning technique applied to optimization constraints (Q490152) (← links)
• A new warmstarting strategy for the primal-dual column generation method (Q494315) (← links)
• Solving the equality generalized traveling salesman problem using the Lin-Kernighan-Helsgaun algorithm (Q499157) (← links)
• Ergodic, primal convergence in dual subgradient schemes for convex programming. II: The case of inconsistent primal problems (Q526828) (← links)
• Symmetric weight constrained traveling salesman problem: Local search (Q535615) (← links)
• An homage to Joseph-Louis Lagrange and Pierre Huard (Q537596) (← links)
• The directed orienteering problem (Q547309) (← links)
• An efficient procedure for obtaining feasible solutions to the n-city traveling salesman problem (Q583125) (← links)
• Lagrangian heuristic for a class of the generalized assignment problems (Q611434) (← links)
• The combinatorial bandwidth packing problem (Q621657) (← links)
• Lower and upper bounds for the \(m\)-peripatetic vehicle routing problem (Q633484) (← links)
• An exact algorithm for the Boolean connectivity problem for \(k\)-CNF (Q638525) (← links)
• A comparison of lower bounds for the symmetric circulant traveling salesman problem (Q643021) (← links)
• Small spectral gap in the combinatorial Laplacian implies Hamiltonian (Q659809) (← links)
• A note on the prize collecting traveling salesman problem (Q687042) (← links)
• Survivable networks, linear programming relaxations and the parsimonious property (Q689117) (← links)
• Capacitated emergency facility siting with multiple levels of backup (Q689256) (← links)
• Experiments with LAGRASP heuristic for set \(k\)-covering (Q691433) (← links)
• Match twice and stitch: a new TSP tour construction heuristic. (Q703270) (← links)
• Solving the combinatorial double auction problem (Q707121) (← links)
• Stochastic set packing problem (Q713096) (← links)
• Symmetric traveling salesman problems (Q721684) (← links)
• The indefinite period traveling salesman problem (Q724039) (← links)
• New semidefinite programming relaxations for the linear ordering and the traveling salesman problem (Q729796) (← links)
• The complexity ecology of parameters: An illustration using bounded max leaf number (Q733736) (← links)
• Uncapacitated flow-based extended formulations (Q745688) (← links)
• The symmetric clustered traveling salesman problem (Q759661) (← links)
• Minimizing the completion time of a project under resource constraints and feeding precedence relations: a Lagrangian relaxation based lower bound (Q766253) (← links)
• Efficient spanning trees (Q796551) (← links)
• Optimizing over the subtour polytope of the travelling salesman problem (Q803048) (← links)
• Solution of large-scale symmetric travelling salesman problems (Q810369) (← links)
• Airline crew scheduling: state-of-the-art (Q817210) (← links)
• On a mixture of the fix-and-relax coordination and Lagrangian substitution schemes for multistage stochastic mixed integer programming (Q839882) (← links)
• Evolutionary algorithms and matroid optimization problems (Q848644) (← links)