On the public citation graph

Computer Scheduling of Public Transport: Urban Passenger Vehicle and Crew Scheduling

0 signed · 183 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.968581openalex-extracted
Exact Algorithms for the Matrix Bid Auction
inferred← citeshttps://doi.org/10.1002/9780470400531.eorms0118openalex-snapshot
Branch‐Price‐and‐Cut Algorithms
inferred← citeshttps://doi.org/10.1002/9780470400531.eorms0233openalex-snapshot
Decomposition Methods for Integer Programming
inferred← citeshttps://doi.org/10.1002/9781118600245.ch9openalex-snapshot
Column Generation in Integer Linear Programming
inferred← citeshttps://doi.org/10.1002/9781119005216.ch9openalex-snapshot
Column Generation in Integer Linear Programming
inferred← citeshttps://doi.org/10.1002/9781119606475.refsopenalex-snapshot
References
inferred← citeshttps://doi.org/10.1002/mcda.436openalex-snapshot
Stepwise multi‐criteria and multi‐strategy design of public transit shuttles
inferred← citeshttps://doi.org/10.1002/net.3230190505openalex-snapshot
A branch and bound algorithm for the multiple depot vehicle scheduling problem
inferred← citeshttps://doi.org/10.1007/0-387-25486-2_12openalex-snapshot
Implementing Mixed Integer Column Generation
inferred← citeshttps://doi.org/10.1007/0-387-25486-2_2openalex-snapshot
Shortest Path Problems with Resource Constraints
inferred← citeshttps://doi.org/10.1007/11493853_18openalex-snapshot
Group Construction for Airline Cabin Crew: Comparing Constraint Programming with Branch and Price
inferred← citeshttps://doi.org/10.1007/3-540-61310-2_5openalex-snapshot
Integer multicommodity flow problems
inferred← citeshttps://doi.org/10.1007/978-0-387-48793-9_2openalex-snapshot
A Branch-And-Price Approach for Graph Multi-Coloring
inferred← citeshttps://doi.org/10.1007/978-0-85729-766-2_1openalex-snapshot
A Review of Optimization Methods
inferred← citeshttps://doi.org/10.1007/978-0-85729-766-2_5openalex-snapshot
Location Theory and Distribution Management
inferred← citeshttps://doi.org/10.1007/978-1-4419-7997-1_63openalex-snapshot
Combinatorial Optimization in Transportation and Logistics Networks
inferred← citeshttps://doi.org/10.1007/978-1-4419-8917-8_7openalex-snapshot
CP Based Branch-and-Price
inferred← citeshttps://doi.org/10.1007/978-1-4613-0303-9_9openalex-snapshot
Applications of Set Covering, Set Packing and Set Partitioning Models: A Survey
inferred← citeshttps://doi.org/10.1007/978-1-4614-1608-1_5openalex-snapshot
Crew Management Information Systems
inferred← citeshttps://doi.org/10.1007/978-1-4615-5203-1_14openalex-snapshot
Crew Scheduling
inferred← citeshttps://doi.org/10.1007/978-1-4615-5755-5_3openalex-snapshot
A Unified Framework for Deterministic Time Constrained Vehicle Routing and Crew Scheduling Problems
inferred← citeshttps://doi.org/10.1007/978-1-4615-5775-3_3openalex-snapshot
New Heuristic Algorithms for the Crew Scheduling Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-17953-3_27openalex-snapshot
A Generic Exact Solver for Vehicle Routing and Related Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-18008-3_10openalex-snapshot
Branching on Multi-aggregated Variables
inferred← citeshttps://doi.org/10.1007/978-3-319-69215-9_5openalex-snapshot
Column Generation for Optimal Shipment Delivery in a Logistic Distribution Network
inferred← citeshttps://doi.org/10.1007/978-3-540-68155-7_18openalex-snapshot
From High-Level Model to Branch-and-Price Solution in G12
inferred← citeshttps://doi.org/10.1007/978-3-642-13193-6_21openalex-snapshot
Experiments with a Generic Dantzig-Wolfe Decomposition for Integer Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-38171-3_25openalex-snapshot
Improving Strong Branching by Propagation
inferred← citeshttps://doi.org/10.1007/978-3-642-57762-8_11openalex-snapshot
An Exact Algorithm for Combining Vehicle Trips
inferred← citeshttps://doi.org/10.1007/978-3-642-59179-2_2openalex-snapshot
Integer Multicommodity Flow Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-85966-3_26openalex-snapshot
Co-ordination of Joint Headways
inferred← citeshttps://doi.org/10.1007/978-3-642-85968-7_14openalex-snapshot
Optimization in Bus Scheduling — Driver Constraints Deadheading Estimation and Size Advantage
inferred← citeshttps://doi.org/10.1007/978-3-642-85968-7_15openalex-snapshot
Real-Time Scheduling on a Transit Bus Route
inferred← citeshttps://doi.org/10.1007/978-3-642-85968-7_25openalex-snapshot
CREW-OPT: Subproblem Modeling in a Column Generation Approach to Urban Crew Scheduling
inferred← citeshttps://doi.org/10.1007/978-3-642-85970-0_11openalex-snapshot
Exact Algorithms for the Multi-Depot Vehicle Scheduling Problem Based on Multicommodity Network Flow Type Formulations
inferred← citeshttps://doi.org/10.1007/978-3-642-85970-0_19openalex-snapshot
Telebus Berlin: Vehicle Scheduling in a Dial-a-Ride System
inferred← citeshttps://doi.org/10.1007/978-3-7908-1921-2_20openalex-snapshot
Local Branching und Branching-Strategien für Umlauf- und Dienstplanung im Regionalverkehr mit unregelmäßigen Fahrplänen
inferred← citeshttps://doi.org/10.1007/978-94-017-0307-9_27openalex-snapshot
An Adjacency-Modeling Problem Based on Constructing Harvesting Areas
inferred← citeshttps://doi.org/10.1007/bf02022036openalex-snapshot
Sensitivity analysis for the matching problem and its use in solving matching problems with a single side constraint
inferred← citeshttps://doi.org/10.1007/bfb0008397openalex-snapshot
New exact and feuristic algorithms for the Crew Scheduling problem
inferred← citeshttps://doi.org/10.1007/s00291-025-00810-5openalex-snapshot
Last-mile logistics via cargo tunnel: exact optimization approaches for the cargo tunnel scheduling problem
inferred← citeshttps://doi.org/10.1007/s00357-014-9155-xopenalex-snapshot
Globally Optimal Clusterwise Regression By Column Generation Enhanced with Heuristics, Sequencing and Ending Subset Optimization
inferred← citeshttps://doi.org/10.1007/s10107-020-01523-zopenalex-snapshot
A generic exact solver for vehicle routing and related problems
inferred← citeshttps://doi.org/10.1007/s10479-006-0017-8openalex-snapshot
The crew timetabling problem: An extension of the crew scheduling problem
inferred← citeshttps://doi.org/10.1007/s10479-007-0274-1openalex-snapshot
Aircraft and crew scheduling for fractional ownership programs
inferred← citeshttps://doi.org/10.1007/s10479-008-0452-9openalex-snapshot
A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint
inferred← citeshttps://doi.org/10.1007/s10589-009-9292-zopenalex-snapshot
Exact approaches for integrated aircraft fleeting and routing at TunisAir
inferred← citeshttps://doi.org/10.1007/s10601-009-9085-0openalex-snapshot
Dantzig-Wolfe decomposition and branch-and-price solving in G12
inferred← citeshttps://doi.org/10.1007/s10732-010-9141-3openalex-snapshot
A Bus Driver Scheduling Problem: a new mathematical model and a GRASP approximate solution
inferred← citeshttps://doi.org/10.1007/s10845-007-0017-9openalex-snapshot
Personnel scheduling in a complex logistic system: a railway application case
inferred← citeshttps://doi.org/10.1007/s11590-012-0557-6openalex-snapshot
A robust optimization approach to dispatching technicians under stochastic service times
inferred← citeshttps://doi.org/10.1007/s12469-009-0010-0openalex-snapshot
Capacity constraints in delay management
inferred← citeshttps://doi.org/10.1007/s13675-014-0021-8openalex-snapshot
Improving strong branching by domain propagation
inferred← citeshttps://doi.org/10.1007/s13676-016-0096-xopenalex-snapshot
A Branch-and-Price algorithm for two multi-compartment vehicle routing problems
inferred← citeshttps://doi.org/10.1007/s13676-017-0106-7openalex-snapshot
Erratum to: A Branch-and-Price algorithm for two multi-compartment vehicle routing problems
inferred← citeshttps://doi.org/10.1007/s43069-020-00047-8openalex-snapshot
Solving Bin Packing Problems Using VRPSolver Models
inferred← citeshttps://doi.org/10.1016/0167-6377(96)00033-8openalex-snapshot
An exact algorithm for IP column generation
inferred← citeshttps://doi.org/10.1016/0305-0548(83)90030-8openalex-snapshot
Routing and scheduling of vehicles and crews
inferred← citeshttps://doi.org/10.1016/0377-2217(94)90395-6openalex-snapshot
Reliability of interconnected scheduled services
inferred← citeshttps://doi.org/10.1016/0377-2217(95)00093-3openalex-snapshot
A tree search algorithm for the crew scheduling problem
inferred← citeshttps://doi.org/10.1016/j.apm.2019.05.007openalex-snapshot
Minimizing the number of machines with limited workload capacity for scheduling jobs with interval constraints
inferred← citeshttps://doi.org/10.1016/j.compchemeng.2014.04.008openalex-snapshot
A MILP-based column generation strategy for managing large-scale maritime distribution problems
inferred← citeshttps://doi.org/10.1016/j.compchemeng.2015.04.039openalex-snapshot
A branch-and-price approach to evaluate the role of cross-docking operations in consolidated supply chains
inferred← citeshttps://doi.org/10.1016/j.compchemeng.2017.06.022openalex-snapshot
A decomposition framework for managing inventory and distribution of fluid products by an order-based-resupply methodology
inferred← citeshttps://doi.org/10.1016/j.cor.2005.09.018openalex-snapshot
A hub location problem with fully interconnected backbone and access networks
inferred← citeshttps://doi.org/10.1016/j.cor.2005.11.010openalex-snapshot
A branch-and-price algorithm to solve the molten iron allocation problem in iron and steel industry
inferred← citeshttps://doi.org/10.1016/j.cor.2007.12.009openalex-snapshot
Exact algorithms for the matrix bid auction
inferred← citeshttps://doi.org/10.1016/j.cor.2008.07.005openalex-snapshot
Robust crew pairing for managing extra flights
inferred← citeshttps://doi.org/10.1016/j.cor.2009.03.024openalex-snapshot
An iterative approach to robust and integrated aircraft routing and crew scheduling
inferred← citeshttps://doi.org/10.1016/j.cor.2009.12.007openalex-snapshot
A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes
inferred← citeshttps://doi.org/10.1016/j.cor.2010.03.010openalex-snapshot
A branch-and-price algorithm for an integrated production and inventory routing problem
inferred← citeshttps://doi.org/10.1016/j.cor.2014.09.009openalex-snapshot
Optimal shift partitioning of pharmacies
inferred← citeshttps://doi.org/10.1016/j.cor.2018.01.012openalex-snapshot
An enhanced MILP-based branch-and-price approach to modularity density maximization on graphs
inferred← citeshttps://doi.org/10.1016/j.cor.2020.104936openalex-snapshot
Unmanned aerial vehicle set covering problem considering fixed-radius coverage constraint
inferred← citeshttps://doi.org/10.1016/j.cor.2020.104945openalex-snapshot
First-order linear programming in a column generation-based heuristic approach to the nurse rostering problem
inferred← citeshttps://doi.org/10.1016/j.dam.2019.09.015openalex-snapshot
On the structure of linear programs with overlapping cardinality constraints
inferred← citeshttps://doi.org/10.1016/j.disopt.2006.10.009openalex-snapshot
Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement
inferred← citeshttps://doi.org/10.1016/j.disopt.2008.01.002openalex-snapshot
A Branch and Price algorithm for the k -splittable maximum flow problem
inferred← citeshttps://doi.org/10.1016/j.disopt.2016.05.004openalex-snapshot
On the mixed set covering, packing and partitioning polytope
inferred← citeshttps://doi.org/10.1016/j.ejco.2023.100074openalex-snapshot
Branch and price for submodular bin packing
inferred← citeshttps://doi.org/10.1016/j.ejor.2003.08.001openalex-snapshot
Supply chain optimization in the pulp mill industry––IP models, column generation and novel constraint branches
inferred← citeshttps://doi.org/10.1016/j.ejor.2004.10.033openalex-snapshot
A branch-and-price approach for operational aircraft maintenance routing
inferred← citeshttps://doi.org/10.1016/j.ejor.2005.01.005openalex-snapshot
Vehicle routing and crew scheduling for metropolitan mail distribution at Australia Post
inferred← citeshttps://doi.org/10.1016/j.ejor.2005.04.028openalex-snapshot
Scheduling trainees at a hospital department using a branch-and-price approach
inferred← citeshttps://doi.org/10.1016/j.ejor.2005.09.016openalex-snapshot
Improving computational capabilities for addressing volume constraints in forest harvest scheduling problems
inferred← citeshttps://doi.org/10.1016/j.ejor.2005.10.008openalex-snapshot
Generating, scheduling and rostering of shift crew-duties: Applications at the Hong Kong International Airport
inferred← citeshttps://doi.org/10.1016/j.ejor.2006.10.060openalex-snapshot
A branch-and-price approach for integrating nurse and surgery scheduling
inferred← citeshttps://doi.org/10.1016/j.ejor.2011.05.021openalex-snapshot
Solving a continuous local access network design problem with a stabilized central column generation approach
inferred← citeshttps://doi.org/10.1016/j.ejor.2014.03.006openalex-snapshot
Branch-and-price and constraint programming for solving a real-life technician dispatching problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2014.08.036openalex-snapshot
Freight railway operator timetabling and engine scheduling
inferred← citeshttps://doi.org/10.1016/j.ejor.2016.10.053openalex-snapshot
Integrating rolling stock scheduling with train unit shunting
inferred← citeshttps://doi.org/10.1016/j.ejor.2016.12.021openalex-snapshot
A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function
inferred← citeshttps://doi.org/10.1016/j.ejor.2017.05.035openalex-snapshot
Resource constrained routing and scheduling: Review and research prospects
inferred← citeshttps://doi.org/10.1016/j.ejor.2017.06.041openalex-snapshot
The daily tail assignment problem under operational uncertainty using look-ahead maintenance constraints
inferred← citeshttps://doi.org/10.1016/j.ejor.2018.02.020openalex-snapshot
A Profit-Maximization Location-Routing-Pricing Problem: A Branch-and-Price Algorithm
inferred← citeshttps://doi.org/10.1016/j.ejor.2019.02.004openalex-snapshot
Rectangle blanket problem: Binary integer linear programming formulation and solution algorithms
inferred← citeshttps://doi.org/10.1016/j.ejor.2019.06.016openalex-snapshot
Railway crew scheduling: Models, methods and applications
inferred← citeshttps://doi.org/10.1016/j.ejor.2019.08.024openalex-snapshot
A branch-and-price algorithm for the two-dimensional vector packing problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2021.05.043openalex-snapshot
A branch-and-price procedure for clustering data that are graph connected
inferred← citeshttps://doi.org/10.1016/j.ejor.2022.03.027openalex-snapshot
Scheduling a single parallel-batching machine with non-identical job sizes and incompatible job families
inferred← citeshttps://doi.org/10.1016/j.ejor.2023.06.028openalex-snapshot
Lower and upper bounding procedures for the bin packing problem with concave loading cost
inferred← citeshttps://doi.org/10.1016/j.ejor.2023.07.012openalex-snapshot
Single machine parallel-batch scheduling under time-of-use electricity prices: New formulations and optimisation approaches
inferred← citeshttps://doi.org/10.1016/j.ejor.2024.11.018openalex-snapshot
Last fifty years of integer linear programming: A focus on recent practical advances
inferred← citeshttps://doi.org/10.1016/j.ejtl.2024.100139openalex-snapshot
A Branch-Price-and-Cut algorithm for the Multi-Commodity two-echelon Distribution Problem
inferred← citeshttps://doi.org/10.1016/j.omega.2019.102150openalex-snapshot
A branch-and-price approach for trip sequence planning of high-speed train units
inferred← citeshttps://doi.org/10.1016/j.orl.2013.09.004openalex-snapshot
Incremental and encoding formulations for Mixed Integer Programming
inferred← citeshttps://doi.org/10.1016/j.trb.2005.05.005openalex-snapshot
An extended branch-and-bound method for locomotive assignment
inferred← citeshttps://doi.org/10.1016/j.trb.2015.03.013openalex-snapshot
Robust weekly aircraft maintenance routing problem and the extension to the tail assignment problem
inferred← citeshttps://doi.org/10.1016/j.trb.2017.03.003openalex-snapshot
A Branch-and-Price algorithm for railway rolling stock rescheduling
inferred← citeshttps://doi.org/10.1016/j.trb.2019.03.005openalex-snapshot
Vehicle routing problem with drones
inferred← citeshttps://doi.org/10.1016/j.trb.2019.07.016openalex-snapshot
Fleet sizing for one-way electric carsharing services considering dynamic vehicle relocation and nonlinear charging profile
inferred← citeshttps://doi.org/10.1016/j.trb.2024.102941openalex-snapshot
A branch-and-price algorithm for integrating urban rail crew scheduling and rostering problems
inferred← citeshttps://doi.org/10.1016/j.tre.2020.102167openalex-snapshot
A branch-price-and-cut algorithm for the vehicle routing problem with release and due dates
inferred← citeshttps://doi.org/10.1016/s0305-0483(97)00074-1openalex-snapshot
Decision support for bus operations under uncertainty: a fuzzy expert system approach
inferred← citeshttps://doi.org/10.1016/s0305-0548(03)00112-6openalex-snapshot
A column generation approach to the coalition formation problem in multi-agent systems
inferred← citeshttps://doi.org/10.1016/s0305-0548(98)00019-7openalex-snapshot
A dynamic programming based algorithm for the crew scheduling problem
inferred← citeshttps://doi.org/10.1016/s0377-2217(03)00095-xopenalex-snapshot
Staff scheduling and rostering: A review of applications, methods and models
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80086-6openalex-snapshot
Chapter 5 Models in urban and air transportation
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80106-9openalex-snapshot
Chapter 2 Time constrained routing and scheduling
inferred← citeshttps://doi.org/10.1021/ie500209eopenalex-snapshot
A Branch-and-Price Approach To Manage Cargo Consolidation and Distribution in Supply Chains
inferred← citeshttps://doi.org/10.1023/a:1009694422257openalex-snapshot
Heuristics Ancient and Modern: Transport Scheduling Through the Ages
inferred← citeshttps://doi.org/10.1023/a:1016002910561openalex-snapshot
An Optimization Based Approach to the Train Operator Scheduling Problem at Singapore MRT
inferred← citeshttps://doi.org/10.1057/jors.2011.27openalex-snapshot
A column generation-based heuristic for rostering with work patterns
inferred← citeshttps://doi.org/10.1057/palgrave.jors.2600728openalex-snapshot
Subgraph Ejection Chains and Tabu Search for the Crew Scheduling Problem
inferred← citeshttps://doi.org/10.1057/palgrave.jors.2601655openalex-snapshot
A Branch & Cut algorithm for a four-index assignment problem
inferred← citeshttps://doi.org/10.1057/palgrave.jors.2602515openalex-snapshot
A branch-and-price algorithm for scheduling sport leagues
inferred← citeshttps://doi.org/10.1080/01605682.2022.2125843openalex-snapshot
A constraint programming based column generation approach for crew scheduling: A case study for the Kayseri railway
inferred← citeshttps://doi.org/10.1080/0740817x.2010.504685openalex-snapshot
Midterm scheduling of physicians with flexible shifts using branch and price
inferred← citeshttps://doi.org/10.1080/0740817x.2013.851434openalex-snapshot
The traveling therapist scheduling problem
inferred← citeshttps://doi.org/10.1080/10556789408805563openalex-snapshot
A set partitioning approach to the multiple depot vehicle scheduling problem
inferred← citeshttps://doi.org/10.1108/9780585475226-002openalex-snapshot
Public Transport Timetabling and Vehicle Scheduling
inferred← citeshttps://doi.org/10.1108/9781615832460-036openalex-snapshot
Public Transport Scheduling
inferred← citeshttps://doi.org/10.1109/access.2021.3128871openalex-snapshot
A Matheuristic Algorithm for the Multiple-Depot Vehicle and Crew Scheduling Problem
inferred← citeshttps://doi.org/10.1111/itor.12050openalex-snapshot
Searching for optimal integer solutions to set partitioning problems using column generation
inferred← citeshttps://doi.org/10.1145/3585516openalex-snapshot
Enabling Research through the SCIP Optimization Suite 8.0
inferred← citeshttps://doi.org/10.1147/rd.513.0325openalex-snapshot
Multicommodity network flow approach to the railroad crew-scheduling problem
inferred← citeshttps://doi.org/10.1201/b12853openalex-snapshot
Public Transit Planning and Operation
inferred← citeshttps://doi.org/10.1287/ijoc.1040.0124openalex-snapshot
Exact Algorithms for a Loading Problem with Bounded Clique Width
inferred← citeshttps://doi.org/10.1287/ijoc.1060.0181openalex-snapshot
Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem
inferred← citeshttps://doi.org/10.1287/ijoc.1100.0406openalex-snapshot
A Branch-and-Price Algorithm for the Bin Packing Problem with Conflicts
inferred← citeshttps://doi.org/10.1287/ijoc.1100.0436openalex-snapshot
Exact Solution of Graph Coloring Problems via Constraint Programming and Column Generation
inferred← citeshttps://doi.org/10.1287/ijoc.1110.0445openalex-snapshot
An Exact Method for Balancing Efficiency and Equity in the Liver Allocation Hierarchy
inferred← citeshttps://doi.org/10.1287/ijoc.1120.0499openalex-snapshot
Bin Packing with Conflicts: A Generic Branch-and-Price Algorithm
inferred← citeshttps://doi.org/10.1287/ijoc.2016.0706openalex-snapshot
The Surgical Patient Routing Problem: A Central Planner Approach
inferred← citeshttps://doi.org/10.1287/ijoc.2017.0800openalex-snapshot
The Vehicle Routing Problem with Floating Targets: Formulation and Solution Approaches
inferred← citeshttps://doi.org/10.1287/ijoc.2022.0257openalex-snapshot
A Numerically Exact Algorithm for the Bin-Packing Problem
inferred← citeshttps://doi.org/10.1287/ijoc.2022.1165openalex-snapshot
Bin Packing Problem with Time Lags
inferred← citeshttps://doi.org/10.1287/ijoo.2019.0013openalex-snapshot
Three-Dimensional Bin Packing and Mixed-Case Palletization
inferred← citeshttps://doi.org/10.1287/mnsc.1040.0222openalex-snapshot
Designing Marine Reserves for Fishery Management
inferred← citeshttps://doi.org/10.1287/mnsc.1040.0332openalex-snapshot
A Branch-and-Price Algorithm and New Test Problems for Spectrum Auctions
inferred← citeshttps://doi.org/10.1287/mnsc.1050.0392openalex-snapshot
Efficient Production-Distribution System Design
inferred← citeshttps://doi.org/10.1287/mnsc.1100.1249openalex-snapshot
Maximizing the Efficiency of the U.S. Liver Allocation System Through Region Design
inferred← citeshttps://doi.org/10.1287/mnsc.44.8.1100openalex-snapshot
An Optimization Based Heuristic for Political Districting
inferred← citeshttps://doi.org/10.1287/opre.1040.0169openalex-snapshot
Harvest Scheduling Subject to Maximum Area Restrictions: Exploring Exact Approaches
inferred← citeshttps://doi.org/10.1287/opre.1050.0234openalex-snapshot
Selected Topics in Column Generation
inferred← citeshttps://doi.org/10.1287/opre.1090.0713openalex-snapshot
Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows
inferred← citeshttps://doi.org/10.1287/opre.1120.1079openalex-snapshot
Cut-First Branch-and-Price-Second for the Capacitated Arc-Routing Problem
inferred← citeshttps://doi.org/10.1287/opre.46.3.316openalex-snapshot
Branch-and-Price: Column Generation for Solving Huge Integer Programs
inferred← citeshttps://doi.org/10.1287/opre.46.4.474openalex-snapshot
Drive: Dynamic Routing of Independent Vehicles
inferred← citeshttps://doi.org/10.1287/opre.46.5.719openalex-snapshot
Optimal Placement of Add/Drop Multiplexers: Heuristic and Exact Algorithms
inferred← citeshttps://doi.org/10.1287/opre.47.6.873openalex-snapshot
A Set Partitioning Approach to the Crew Scheduling Problem
inferred← citeshttps://doi.org/10.1287/opre.48.2.318.12378openalex-snapshot
Using Branch-and-Price-and-Cut to Solve Origin-Destination Integer Multicommodity Flow Problems
inferred← citeshttps://doi.org/10.1287/trsc.1050.0122openalex-snapshot
Vehicle Routing and Staffing for Sedan Service
inferred← citeshttps://doi.org/10.1287/trsc.1050.0134openalex-snapshot
Planning for Robust Airline Operations: Optimizing Aircraft Routings and Flight Departure Times to Minimize Passenger Disruptions
inferred← citeshttps://doi.org/10.1287/trsc.1060.0156openalex-snapshot
Location-Routing Problems with Distance Constraints
inferred← citeshttps://doi.org/10.1287/trsc.1070.0218openalex-snapshot
A Branch-and-Price-and-Cut Method for Ship Scheduling with Limited Risk
inferred← citeshttps://doi.org/10.1287/trsc.1100.0338openalex-snapshot
On a New Rotation Tour Network Model for Aircraft Maintenance Routing Problem
inferred← citeshttps://doi.org/10.1287/trsc.17.1.4openalex-snapshot
A Matching Based Heuristic for Scheduling Mass Transit Crews and Vehicles
inferred← citeshttps://doi.org/10.1287/trsc.2013.0463openalex-snapshot
The Recoverable Robust Tail Assignment Problem
inferred← citeshttps://doi.org/10.1287/trsc.2013.0468openalex-snapshot
Transit Bus Scheduling with Limited Energy
inferred← citeshttps://doi.org/10.1287/trsc.2014.0524openalex-snapshot
A Branch-and-Price-and-Cut Algorithm for Heterogeneous Pickup and Delivery Problems with Configurable Vehicle Capacity
inferred← citeshttps://doi.org/10.1287/trsc.2014.0552openalex-snapshot
Solving the Integrated Airline Recovery Problem Using Column-and-Row Generation
inferred← citeshttps://doi.org/10.1287/trsc.2014.0580openalex-snapshot
Optimization Methods for Multistage Freight Train Formation
inferred← citeshttps://doi.org/10.1287/trsc.2015.0623openalex-snapshot
A Novel Model and Decomposition Approach for the Integrated Airline Fleet Assignment, Aircraft Routing, and Crew Pairing Problem
inferred← citeshttps://doi.org/10.1287/trsc.2015.0648openalex-snapshot
Integrating Timetabling and Crew Scheduling at a Freight Railway Operator
inferred← citeshttps://doi.org/10.1287/trsc.2023.0345openalex-snapshot
Generalized Riskiness Index in Vehicle Routing Under Uncertain Travel Times: Formulations, Properties, and Exact Solution Framework
inferred← citeshttps://doi.org/10.1287/trsc.32.3.208openalex-snapshot
Flight String Models for Aircraft Fleeting and Routing
inferred← citeshttps://doi.org/10.1287/trsc.35.3.286.10153openalex-snapshot
Simultaneous Vehicle and Crew Scheduling in Urban Mass Transit Systems
inferred← citeshttps://doi.org/10.1287/trsc.37.4.368.23276openalex-snapshot
Applications of Operations Research in the Air Transport Industry
inferred← citeshttps://doi.org/10.1590/s0104-530x2004000200005openalex-snapshot
Uma proposta de solução para o problema da construção de escalas de motoristas e cobradores de ônibus por meio do algoritmo do matching de peso máximo
inferred← citeshttps://doi.org/10.1609/icaps.v24i1.13628openalex-snapshot
Fragment-Based Planning Using Column Generation
inferred← citeshttps://doi.org/10.3141/1760-01openalex-snapshot
Bus Timetables with Even Passenger Loads as Opposed to Even Headways
inferred← citeshttps://doi.org/10.4018/978-1-59904-546-7.ch015openalex-snapshot
Case Study III
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.