The following pages link to Paolo Toth (Q181212):
Displayed 50 items.
- Modeling and Solving the Train Timetabling Problem (Q3635144) (← links)
- An Exact Algorithm for the Two-Constraint 0–1 Knapsack Problem (Q3637393) (← links)
- Algorithm 632: A program for the 0–1 multiple knapsack problem (Q3675904) (← links)
- (Q3686500) (← links)
- (Q3751373) (← links)
- (Q3751378) (← links)
- The Fixed Job Schedule Problem with Spread-Time Constraints (Q3779989) (← links)
- A New Algorithm for the 0-1 Knapsack Problem (Q3789335) (← links)
- A branch and bound algorithm for the multiple depot vehicle scheduling problem (Q3826353) (← links)
- The Fixed Job Schedule Problem with Working-Time Constraints (Q3826354) (← links)
- An Additive Bounding Procedure for Combinatorial Optimization Problems (Q3832317) (← links)
- (Q3853463) (← links)
- Dynamic Loading and Unloading of Liquids into Tanks (Q3887189) (← links)
- Technical Note—A Note on the Ingargiola-Korsh Algorithm for One-Dimensional Knapsack Problems (Q3888837) (← links)
- Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem (Q3890444) (← links)
- State-space relaxation procedures for the computation of bounds to routing problems (Q3908783) (← links)
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations (Q3911683) (← links)
- (Q3929530) (← links)
- Finding a minimum equivalent graph of a digraph (Q3944018) (← links)
- (Q3968762) (← links)
- Approximation Algorithms for Fixed Job Schedule Problems (Q3990569) (← links)
- (Q3993418) (← links)
- (Q4145176) (← links)
- (Q4149228) (← links)
- (Q4197626) (← links)
- (Q4205235) (← links)
- An Exact Algorithm for the Vehicle Routing Problem with Backhauls (Q4233781) (← links)
- (Q4247440) (← links)
- An Efficient Algorithm for the Min-Sum Arborescence Problem on Complete Digraphs (Q4282274) (← links)
- A parallel shortest augmenting path algorithm for the assignment problem (Q4302861) (← links)
- A Branch-and-Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs (Q4319767) (← links)
- (Q4350083) (← links)
- (Q4353005) (← links)
- Heuristic Algorithms for the Handicapped Persons Transportation Problem (Q4367065) (← links)
- A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem (Q4367232) (← links)
- Exact solution of large-scale, asymmetric traveling salesman problems (Q4371607) (← links)
- Algorithm 750: CDT (Q4371613) (← links)
- A Polyhedral Approach to the Asymmetric Traveling Salesman Problem (Q4392516) (← links)
- Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems (Q4393124) (← links)
- (Q4414638) (← links)
- Solving the Orienteering Problem through Branch-and-Cut (Q4427336) (← links)
- Exact Solution of the Quadratic Knapsack Problem (Q4427369) (← links)
- (Q4461906) (← links)
- (Q4461915) (← links)
- (Q4532223) (← links)
- (Q4532224) (← links)
- (Q4532230) (← links)
- A heuristic algorithm for the set covering problem (Q4645914) (← links)
- (Q4699368) (← links)
- The symmetric generalized traveling salesman polytope (Q4894874) (← links)