The Continuous-Time Service Network Design Problem
From MaRDI portal
(Redirected from Publication:4598647)
Recommendations
- scientific article; zbMATH DE number 1002205
- Service-constrained network design problems
- On the optimality of the sequential approach for network design problems of service operations
- Complexity and approximation of the continuous network design problem
- Complexity and Approximation of the Continuous Network Design Problem
- On solving continuous-time dynamic network flows
- A continuous-time network simplex algorithm
- scientific article; zbMATH DE number 1163719
- Subgradient Methods for the Service Network Design Problem
- Scheduled service network design with quality targets and stochastic travel times
Cited in
(40)- Layered graph approaches for combinatorial optimization problems
- Perspectives on integer programming for time-dependent models
- Soft clustering-based scenario bundling for a progressive hedging heuristic in stochastic service network design
- Scheduled service network design with quality targets and stochastic travel times
- An exact algorithm for a class of geometric set-cover problems
- Scheduling activities with time-dependent durations and resource consumptions
- Optimizing the changing locations of mobile parcel lockers in last-mile distribution
- Arc flow formulations based on dynamic programming: theoretical foundations and applications
- Improved models for a single vehicle continuous-time inventory routing problem with pickups and deliveries
- Models and algorithms for the traveling salesman problem with time-dependent service times
- Solving a dial-a-flight problem using composite variables
- Express shipment service network design with complex routes
- An iterative graph expansion approach for the scheduling and routing of airplanes
- The transit time constrained fixed charge multi-commodity network design problem
- Dynamic discretization discovery for solving the continuous time inventory routing problem with out-and-back routes
- A column generation and combinatorial Benders decomposition algorithm for the selective dial-a-ride-problem
- Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery
- Subgradient Methods for the Service Network Design Problem
- Composite Variable Formulations for Express Shipment Service Network Design
- A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games
- Dynamic Discretization Discovery Algorithms for Time-Dependent Shortest Path Problems
- A General Branch-and-Cut Framework for Rotating Workforce Scheduling
- A repeated route-then-schedule approach to coordinated vehicle platooning: algorithms, valid inequalities and computation
- Fleet management for autonomous vehicles using flows in time-expanded networks
- The multi-hour service system design problem
- Mathematical formulations for multi-period network design with modular capacity adjustments
- An iterative time‐bucket refinement algorithm for a high‐resolution resource‐constrained project scheduling problem
- An exact algorithm for the service network design problem with hub capacity constraints
- Scalable timing-aware network design via Lagrangian decomposition
- A continuous‐time service network design and vehicle routing problem
- Electric vehicle-based express service network design with recharging management: a branch-and-price approach
- A parallel branch-and-bound heuristic for the integrated long-haul and local vehicle routing problem on an adaptive transportation network
- A MaxSAT approach for solving a new dynamic discretization discovery model for train rescheduling problems
- A hybrid algorithm for large-scale service network design considering a heterogeneous fleet
- On-demand meal delivery: drone scheduling with battery replacement optimization
- Algorithms for pickup and delivery problems with hours of service constraints
- Perspectives on optimizing transport systems with supply-dependent demand
- Sparse dynamic discretization discovery via arc-dependent time discretizations
- Last fifty years of integer linear programming: a focus on recent practical advances
- An improved freight transportation planning system for less-than-truckload operations of a third-party logistics carrier
This page was built for publication: The Continuous-Time Service Network Design Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4598647)
