Pages that link to "Item:Q4427336"

The following pages link to Solving the Orienteering Problem through Branch-and-Cut (Q4427336):

Displaying 50 items.

• The clustered orienteering problem (Q296772) (← links)
• The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: a branch-and-price approach (Q320623) (← links)
• Integer programming formulations for the elementary shortest path problem (Q322844) (← links)
• Orienteering problem: a survey of recent variants, solution approaches and applications (Q323527) (← links)
• The traveling purchaser problem, with multiple stacks and deliveries: a branch-and-cut approach (Q336445) (← links)
• A two-stage approach to the orienteering problem with stochastic weights (Q336923) (← links)
• Solving the orienteering problem with time windows via the pulse framework (Q337360) (← links)
• Exact algorithms for the double vehicle routing problem with multiple stacks (Q342039) (← links)
• A branch-and-cut algorithm for the orienteering arc routing problem (Q342166) (← links)
• Solving the team orienteering problem with cutting planes (Q342446) (← links)
• A hybrid algorithm for the DNA sequencing problem (Q406500) (← links)
• Hybridized evolutionary local search algorithm for the team orienteering problem with time windows (Q415560) (← links)
• Robust UAV mission planning (Q490224) (← links)
• On the kidney exchange problem: cardinality constrained cycle and chain problems on directed graphs: a survey of integer programming approaches (Q512864) (← links)
• Analysis of the maximum level policy in a production-distribution system (Q547123) (← links)
• The orienteering problem: a survey (Q617509) (← links)
• Heuristic algorithms for visiting the customers in a rolling schedule environment (Q850656) (← links)
• An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits (Q953423) (← links)
• Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming (Q958452) (← links)
• The effective application of a new approach to the generalized orienteering problem (Q972648) (← links)
• A path relinking approach for the team orienteering problem (Q975993) (← links)
• The attractive traveling salesman problem (Q1043335) (← links)
• Algorithms to solve the orienteering problem: A comparison (Q1119489) (← links)
• Strong linear programming relaxations for the orienteering problem (Q1328645) (← links)
• The ring spur assignment problem: new formulation, valid inequalities and a branch-and-cut approach (Q1651527) (← links)
• Reformulations and branch-and-price algorithm for the minimum cost hop-and-root constrained forest problem (Q1651640) (← links)
• Managing platelet supply through improved routing of blood collection vehicles (Q1651648) (← links)
• A hybrid variable neighborhood search for the orienteering problem with mandatory visits and exclusionary constraints (Q1652104) (← links)
• The probabilistic orienteering problem (Q1652250) (← links)
• Multi-commodity location-routing: flow intercepting formulation and branch-and-cut algorithm (Q1652448) (← links)
• An efficient evolutionary algorithm for the orienteering problem (Q1652505) (← links)
• The bi-objective insular traveling salesman problem with maritime and ground transportation costs (Q1653384) (← links)
• The vehicle routing problem with service level constraints (Q1681277) (← links)
• Gotta (efficiently) catch them all: Pokémon GO meets orienteering problems (Q1681305) (← links)
• Formulations for the orienteering problem with additional constraints (Q1686508) (← links)
• Decision support for flexible liner shipping (Q1748505) (← links)
• Application of fuzzy optimization to the orienteering problem (Q1750202) (← links)
• Local search inequalities (Q1751111) (← links)
• Solving the team orienteering arc routing problem with a column generation approach (Q1754007) (← links)
• A memetic algorithm for the orienteering problem with mandatory visits and exclusionary constraints (Q1754303) (← links)
• A TABU search heuristic for the team orienteering problem (Q1764755) (← links)
• Locating median cycles in networks (Q1887911) (← links)
• Coupling ant colony systems with strong local searches (Q1926808) (← links)
• A Tabu search algorithm for the probabilistic orienteering problem (Q2026967) (← links)
• Efficiently solving the thief orienteering problem with a max-min ant colony optimization approach (Q2080825) (← links)
• Boosting ant colony optimization via solution prediction and machine learning (Q2147035) (← links)
• Exact algorithms for budgeted prize-collecting covering subgraph problems (Q2147080) (← links)
• Hybrid dynamic programming with bounding algorithm for the multi-profit orienteering problem (Q2158007) (← links)
• Combinatorial algorithms for rooted prize-collecting walks and applications to orienteering and minimum-latency problems (Q2164695) (← links)
• Valid inequalities for mixed-integer programmes with fixed charges on sets of variables (Q2183195) (← links)