Pages that link to "Item:Q5633847"

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

Displaying 39 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)
• Incorporating Aggregate Diversity in Recommender Systems Using Scalable Optimization Approaches (Q4599312) (← links)
• New Approximation Algorithms for (1,2)-TSP (Q5002675) (← links)
• Semidefinite Programming Relaxations of the Traveling Salesman Problem and Their Integrality Gaps (Q5076689) (← links)
• Integer Programming Formulations for Minimum Spanning Tree Interdiction (Q5084609) (← links)
• Hidden Hamiltonian Cycle Recovery via Linear Programming (Q5130484) (← links)
• Solving the Watchman Route Problem with Heuristic Search (Q5870496) (← links)
• An effective approach for optimization of a perishable inventory system with uncertainty in both demand and supply (Q6071068) (← links)
• Configuration‐based approach for topological problems in the design of wireless sensor networks (Q6088118) (← links)
• Formulations and a Lagrangian relaxation approach for the prize collecting traveling salesman problem (Q6091422) (← links)
• A reinforced hybrid genetic algorithm for the traveling salesman problem (Q6106563) (← links)
• Polyhedral techniques in combinatorial optimization: matchings and tours (Q6118160) (← links)
• Refinement of Lagrangian bounds in optimization problems (Q6122370) (← links)
• An efficient mixed integer linear programming model for the minimum spanning tree problem (Q6162004) (← links)