Pages that link to "Item:Q1184344"

The following pages link to An additive bounding procedure for the asymmetric travelling salesman problem (Q1184344):

Displaying 26 items.

• Improved filtering for weighted circuit constraints (Q487627) (← links)
• Models, relaxations and exact approaches for the capacitated vehicle routing problem (Q697581) (← links)
• Self-organizing feature maps for the vehicle routing problem with backhauls (Q880535) (← links)
• Minimax regret spanning arborescences under uncertain costs (Q881514) (← links)
• A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls (Q1124810) (← links)
• A heuristic algorithm for the asymmetric capacitated vehicle routing problem (Q1266654) (← links)
• Heuristics for the flow line problem with setup costs (Q1303708) (← links)
• Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems (Q1580967) (← links)
• SelfSplit parallelization for mixed-integer linear programming (Q1652584) (← links)
• Cluster based branching for the asymmetric traveling salesman problem (Q1806732) (← links)
• New lower bounds for the symmetric travelling salesman problem (Q1824572) (← links)
• A capacitated general routing problem on mixed networks (Q1894722) (← links)
• An exact algorithm for the capacitated shortest spanning arborescence (Q1908299) (← links)
• Routing problems: A bibliography (Q1908308) (← links)
• The weighted arborescence constraint (Q2011589) (← links)
• A lift-and-project cutting plane algorithm for mixed 0-1 programs (Q2367913) (← links)
• Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs (Q2384394) (← links)
• An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation (Q2482754) (← links)
• A Column Generation Model for a Scheduling Problem with Maintenance Constraints (Q2741258) (← links)
• (Q5020990) (← links)
• A Stochastic Integer Programming Approach to Air Traffic Scheduling and Operations (Q5144771) (← links)
• A branch‐and‐bound algorithm for the double travelling salesman problem with two stacks (Q5326779) (← links)
• Heuristics from Nature for Hard Combinatorial Optimization Problems (Q5690286) (← links)
• The Rural Postman Problem on mixed graphs with turn penalties (Q5959378) (← links)
• Matheuristics: survey and synthesis (Q6056873) (← links)
• An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading (Q6160334) (← links)