Pages that link to "Item:Q2339836"

The following pages link to A branch-and-cut algorithm for the capacitated profitable tour problem (Q2339836):

Displaying 17 items.

• Compact formulations of the Steiner traveling salesman problem and related problems (Q257227) (← links)
• Integer programming formulations for the elementary shortest path problem (Q322844) (← links)
• Solving resource constrained shortest path problems with LP-based methods (Q342436) (← links)
• Nested branch-and-price-and-cut for vehicle routing problems with multiple resource interdependencies (Q666967) (← links)
• The manpower allocation problem with time windows and job-teaming constraints: A branch-and-price approach (Q958447) (← links)
• The vehicle routing problem with service level constraints (Q1681277) (← links)
• A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints (Q2029262) (← links)
• On solving cycle problems with branch-and-cut: extending shrinking and exact subcycle elimination separation algorithms (Q2241575) (← links)
• A note on the separation of subtour elimination constraints in elementary shortest path problems (Q2355890) (← links)
• The multi-vehicle profitable pickup and delivery problem (Q2362250) (← links)
• Formulations and exact algorithms for the vehicle routing problem with time windows (Q2468488) (← links)
• Branch-and-check approaches for the tourist trip design problem with rich constraints (Q2669676) (← links)
• A selective adaptive large neighborhood search heuristic for the profitable tour problem with simultaneous pickup and delivery services (Q4634326) (← links)
• A Pricing Algorithm for the Vehicle Routing Problem with Soft Time Windows (Q5850940) (← links)
• On Accuracy of Approximation for the Resource Constrained Shortest Path Problem (Q5853434) (← links)
• Solving the probabilistic profitable tour problem on a line (Q6081600) (← links)
• The hiking tourist problem (Q6558645) (← links)