An iterative exact algorithm solves a mixed-integer line planning model faster than CPLEX by dynamically expanding paths and frequencies, and accounting for lost demand improves overall resource efficiency.
A MaxSAT Approach for Solving a New Dynamic Discretization Discovery Model for Train Rescheduling Problems.Com- put
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.OC 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
The Keplerian TSP models time-dependent interplanetary rendezvous missions as a discrete optimization problem using time-unfolding and ILP solvers, with released benchmarks and heuristics.
citing papers explorer
-
An Exact Algorithm for Public Transport Line Planning Considering Passenger and Operational Costs and Lost Demand
An iterative exact algorithm solves a mixed-integer line planning model faster than CPLEX by dynamically expanding paths and frequencies, and accounting for lost demand improves overall resource efficiency.
-
The Keplerian Traveling Salesperson Problem
The Keplerian TSP models time-dependent interplanetary rendezvous missions as a discrete optimization problem using time-unfolding and ILP solvers, with released benchmarks and heuristics.