Pages that link to "Item:Q2899063"

The following pages link to Path-Reduced Costs for Eliminating Arcs in Routing and Scheduling (Q2899063):

Displaying 24 items.

• Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems (Q621754) (← links)
• Separating valid odd-cycle and odd-set inequalities for the multiple depot vehicle scheduling problem (Q743645) (← links)
• A branch-and-price algorithm for the minimum latency problem (Q1652580) (← links)
• Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem (Q1662642) (← links)
• Perspectives on integer programming for time-dependent models (Q2001858) (← links)
• Avoiding redundant columns by adding classical Benders cuts to column generation subproblems (Q2019426) (← links)
• The conditional \(p\)-dispersion problem (Q2046325) (← links)
• New exact techniques applied to a class of network flow formulations (Q2061874) (← links)
• Robust vehicle routing under uncertainty via branch-price-and-cut (Q2101653) (← links)
• New exact and heuristic algorithms to solve the prize-collecting job sequencing problem with one common and multiple secondary resources (Q2106718) (← links)
• Exact makespan minimization of unrelated parallel machines (Q2165594) (← links)
• A generic exact solver for vehicle routing and related problems (Q2196312) (← links)
• Arc flow formulations based on dynamic programming: theoretical foundations and applications (Q2239929) (← links)
• A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints (Q2339816) (← links)
• Improved branch-cut-and-price for capacitated vehicle routing (Q2398107) (← links)
• Upper and lower bounds for the vehicle-routing problem with private fleet and common carrier (Q2422737) (← links)
• A branch-cut-and-price algorithm for the traveling salesperson problem with hotel selection (Q2664333) (← links)
• A POPMUSIC matheuristic for the capacitated vehicle routing problem (Q2669570) (← links)
• Exact solution of network flow models with strong relaxations (Q2689828) (← links)
• New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows (Q4599317) (← links)
• Branch-Cut-and-Price for the Robust Capacitated Vehicle Routing Problem with Knapsack Uncertainty (Q5003707) (← links)
• Estimating the marginal cost to deliver to individual customers (Q6088526) (← links)
• Selective arc‐ng pricing for vehicle routing (Q6092607) (← links)
• Solving the skiving stock problem by a combination of stabilized column generation and the reflect arc-flow model (Q6157429) (← links)