Pages that link to "Item:Q4598647"

The following pages link to The Continuous-Time Service Network Design Problem (Q4598647):

Displaying 25 items.

• A hybrid algorithm for large-scale service network design considering a heterogeneous fleet (Q666955) (← links)
• Layered graph approaches for combinatorial optimization problems (Q1628112) (← links)
• Perspectives on integer programming for time-dependent models (Q2001858) (← links)
• Soft clustering-based scenario bundling for a progressive hedging heuristic in stochastic service network design (Q2027067) (← links)
• An exact algorithm for a class of geometric set-cover problems (Q2030243) (← links)
• Scheduling activities with time-dependent durations and resource consumptions (Q2140190) (← links)
• Optimizing the changing locations of mobile parcel lockers in last-mile distribution (Q2184067) (← links)
• Arc flow formulations based on dynamic programming: theoretical foundations and applications (Q2239929) (← links)
• Improved models for a single vehicle continuous-time inventory routing problem with pickups and deliveries (Q2242202) (← links)
• Models and algorithms for the traveling salesman problem with time-dependent service times (Q2294625) (← links)
• Solving a dial-a-flight problem using composite variables (Q2307323) (← links)
• An iterative graph expansion approach for the scheduling and routing of airplanes (Q2337398) (← links)
• The transit time constrained fixed charge multi-commodity network design problem (Q2669603) (← links)
• Dynamic discretization discovery for solving the continuous time inventory routing problem with out-and-back routes (Q2669743) (← links)
• A column generation and combinatorial Benders decomposition algorithm for the selective dial-a-ride-problem (Q2669775) (← links)
• Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery (Q2672110) (← links)
• A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games (Q5085997) (← links)
• Dynamic Discretization Discovery Algorithms for Time-Dependent Shortest Path Problems (Q5086009) (← links)
• A General Branch-and-Cut Framework for Rotating Workforce Scheduling (Q5087722) (← links)
• A Repeated Route-then-Schedule Approach to Coordinated Vehicle Platooning: Algorithms, Valid Inequalities and Computation (Q5106379) (← links)
• Fleet management for autonomous vehicles using flows in time-expanded networks (Q5918172) (← links)
• An iterative time‐bucket refinement algorithm for a high‐resolution resource‐constrained project scheduling problem (Q6066724) (← links)
• An exact algorithm for the service network design problem with hub capacity constraints (Q6085889) (← links)
• Scalable timing-aware network design via Lagrangian decomposition (Q6112744) (← links)
• A continuous‐time service network design and vehicle routing problem (Q6196874) (← links)