Pages that link to "Item:Q3832349"

The following pages link to The prize collecting traveling salesman problem (Q3832349):

Displaying 50 items.

• Compact formulations of the Steiner traveling salesman problem and related problems (Q257227) (← links)
• Notes on the single route lateral transhipment problem (Q276506) (← links)
• Modeling lotsizing and scheduling problems with sequence dependent setups (Q297372) (← links)
• Robust optimization for routing problems on trees (Q301384) (← links)
• Network repair crew scheduling and routing for emergency relief distribution problem (Q320672) (← links)
• Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests (Q322826) (← links)
• Integer programming formulations for the elementary shortest path problem (Q322844) (← links)
• The Canadian tour operator problem on paths: tight bounds and resource augmentation (Q326483) (← links)
• Geometric hitting set, set cover and generalized class cover problems with half-strips in opposite directions (Q335346) (← links)
• The traveling purchaser problem, with multiple stacks and deliveries: a branch-and-cut approach (Q336445) (← links)
• Capacitated lot-sizing and scheduling with sequence-dependent, period-overlapping and non-triangular setups (Q539458) (← links)
• The transit route arc-node service maximization problem (Q621660) (← links)
• Approximation algorithms for supply chain planning and logistics problems with market choice (Q647392) (← links)
• A note on the prize collecting traveling salesman problem (Q687042) (← links)
• Local search algorithms for the red-blue median problem (Q692631) (← links)
• The dynamic dispatch waves problem for same-day delivery (Q724132) (← links)
• Algorithms for the on-line quota traveling salesman problem (Q834904) (← links)
• Multi-objective meta-heuristics for the traveling salesman problem with profits (Q928691) (← links)
• An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits (Q953423) (← links)
• The online prize-collecting traveling salesman problem (Q963439) (← links)
• Approximation algorithms for group prize-collecting and location-routing problems (Q1003471) (← links)
• A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs (Q1025987) (← links)
• A tabu search heuristic for the vehicle routing problem with private fleet and common carrier (Q1026772) (← links)
• On symmetric subtour problems (Q1202764) (← links)
• A Lagrangian heuristic for the Prize Collecting Travelling Salesman Problem (Q1265891) (← links)
• A fast and effective heuristic for the orienteering problem (Q1266618) (← links)
• Minimum directed 1-subtree relaxation for score orienteering problem (Q1291640) (← links)
• A model for warehouse order picking (Q1291697) (← links)
• An efficient composite heuristic for the symmetric generalized traveling salesman problem (Q1296792) (← links)
• A constant-factor approximation algorithm for the \(k\)-MST problem (Q1305925) (← links)
• A heuristic for the multiple tour maximum collection problem (Q1317095) (← links)
• The median tour and maximal covering tour problems: Formulations and heuristics (Q1328602) (← links)
• The hot strip mill production scheduling problem: A tabu search approach (Q1609896) (← links)
• The time constrained maximal covering salesman problem (Q1631991) (← links)
• Multi-vehicle prize collecting arc routing for connectivity problem (Q1652266) (← links)
• An efficient evolutionary algorithm for the orienteering problem (Q1652505) (← links)
• Gotta (efficiently) catch them all: Pokémon GO meets orienteering problems (Q1681305) (← links)
• The time-dependent capacitated profitable tour problem with time windows and precedence constraints (Q1681438) (← links)
• A unified matheuristic for solving multi-constrained traveling salesman problems with profits (Q1707083) (← links)
• Weighted matching with pair restrictions (Q1749789) (← links)
• The packing while traveling problem (Q1751654) (← links)
• Development of hybrid evolutionary algorithms for production scheduling of hot strip mill (Q1761983) (← links)
• The vehicle routing-allocation problem: A unifying framework (Q1814811) (← links)
• Strong lower bounds for the prize collecting Steiner problem in graphs (Q1827870) (← links)
• Approximation algorithms for time-dependent orienteering. (Q1853044) (← links)
• Locating median cycles in networks (Q1887911) (← links)
• A constrained matching problem (Q1897380) (← links)
• Routing problems: A bibliography (Q1908308) (← links)
• On the nucleolus of the basic vehicle routing game (Q1919815) (← links)
• Column generation based heuristics for a generalized location routing problem with profits arising in space exploration (Q1926985) (← links)