Pages that link to "Item:Q5641007"

The following pages link to The traveling-salesman problem and minimum spanning trees: Part II (Q5641007):

Displaying 50 items.

• The salesman and the tree: the importance of search in CP (Q272000) (← links)
• Optimal capacitated ring trees (Q286687) (← links)
• A cross-decomposition scheme with integrated primal-dual multi-cuts for two-stage stochastic programming investment planning problems (Q291046) (← 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)
• Scenario cluster decomposition of the Lagrangian dual in two-stage stochastic mixed 0-1 optimization (Q339591) (← links)
• Cluster Lagrangean decomposition in multistage stochastic optimization (Q342253) (← links)
• A hybrid approach of bundle and Benders applied large mixed linear integer problem (Q364462) (← links)
• Combining probabilistic algorithms, constraint programming and Lagrangian relaxation to solve the vehicle routing problem (Q421467) (← links)
• Certifying algorithms (Q465678) (← 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)
• 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)
• A branch and bound algorithm for the capacitated vehicle routing problem (Q585095) (← links)
• A decomposition heuristic for the maximal covering location problem (Q606191) (← links)
• The combinatorial bandwidth packing problem (Q621657) (← links)
• Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times (Q631908) (← links)
• A modified Lin--Kernighan traveling-salesman heuristic (Q688925) (← links)
• Survivable networks, linear programming relaxations and the parsimonious property (Q689117) (← links)
• An exact algorithm for side-chain placement in protein design (Q691432) (← links)
• Experiments with LAGRASP heuristic for set \(k\)-covering (Q691433) (← links)
• Models, relaxations and exact approaches for the capacitated vehicle routing problem (Q697581) (← links)
• Match twice and stitch: a new TSP tour construction heuristic. (Q703270) (← links)
• On efficient matheuristic algorithms for multi-period stochastic facility location-assignment problems (Q721958) (← links)
• Hub-and-spoke network design and fleet deployment for string planning of liner shipping (Q727347) (← links)
• Models and Lagrangian heuristics for a two-level lot-sizing problem with bounded inventory (Q747754) (← links)
• Heuristically guided algorithm for k-parity matroid problems (Q754224) (← links)
• The symmetric clustered traveling salesman problem (Q759661) (← links)
• Transforming asymmetric into symmetric traveling salesman problems (Q787877) (← links)
• An equivalent subproblem relaxation for improving the solution of a class of transportation scheduling problems (Q792216) (← links)
• Solving capacitated clustering problems (Q799059) (← links)
• Solution of large-scale symmetric travelling salesman problems (Q810369) (← links)
• The multiple depot, multiple traveling salesmen facility-location problem: Vehicle range, service frequency, and heuristic implementations (Q814246) (← links)
• Average-case analysis of best-first search in two representative directed acyclic graphs (Q814592) (← links)
• About Lagrangian methods in integer optimization (Q817183) (← links)
• Airline crew scheduling: state-of-the-art (Q817210) (← links)
• Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem (Q875414) (← links)
• The quadratic knapsack problem -- a survey (Q875597) (← links)
• A lower bound for the breakpoint phylogeny problem (Q876716) (← links)
• New filtering for \textsc{AtMostNValue} and its weighted variant: a Lagrangian approach (Q890005) (← links)
• Lower bounds for the symmetric travelling salesman problem from Lagrangean relaxations (Q908860) (← links)
• A dual ascent algorithm for the 1-tree relaxation of the symmetric traveling salesman problem (Q911484) (← links)
• Classification of travelling salesman problem formulations (Q911990) (← links)
• On single courier problem (Q941049) (← links)
• A cross entropy-lagrangean hybrid algorithm for the multi-item capacitated lot-sizing problem with setup times (Q954053) (← links)
• Real-time vehicle rerouting problems with time windows (Q958553) (← links)