The following pages link to Paolo Toth (Q181212):
Displayed 50 items.
- New trends in exact algorithms for the \(0-1\) knapsack problem (Q1569935) (← links)
- Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems (Q1580967) (← links)
- A matheuristic for the two-stage fixed-charge transportation problem (Q1652635) (← links)
- New lower bounds for the symmetric travelling salesman problem (Q1824572) (← links)
- Algorithm for the solution of the assignment problem for sparse matrices (Q1838425) (← links)
- An exact algorithm for the capacitated shortest spanning arborescence (Q1908299) (← links)
- Nominal and robust train timetabling problems (Q1926692) (← links)
- Finding cliques of maximum weight on a generalization of permutation graphs (Q1940437) (← links)
- Algorithms and codes for dense assignment problems: The state of the art (Q1962018) (← links)
- Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem (Q2030649) (← links)
- Models and algorithms for the traveling salesman problem with time-dependent service times (Q2294625) (← links)
- An overview of curriculum-based course timetabling (Q2355018) (← links)
- Rejoinder on: ``An overview of curriculum-based course timetabling'' (Q2355019) (← links)
- Exact approaches for solving robust prize-collecting Steiner tree problems (Q2355891) (← links)
- On integer polytopes with few nonzero vertices (Q2376738) (← links)
- A note on the Bertsimas \& Sim algorithm for robust combinatorial optimization problems (Q2441360) (← links)
- A Lagrangian heuristic for a train-unit assignment problem (Q2446297) (← links)
- An evolutionary approach for bandwidth multicoloring problems (Q2482742) (← links)
- A Lagrangian heuristic algorithm for a real-world train timetabling problem (Q2489900) (← links)
- A new ILP-based refinement heuristic for vehicle routing problems (Q2583137) (← links)
- Solving a real-world train-unit assignment problem (Q2638371) (← links)
- (Q2759903) (← links)
- Modeling and Solving the Crew Rostering Problem (Q2781158) (← links)
- A Survey of Optimization Models for Train Routing and Scheduling (Q2783827) (← links)
- The Generalized Covering Salesman Problem (Q2815466) (← links)
- Delay-Robust Event Scheduling (Q2875596) (← links)
- A Variable Neighborhood Search and its Application to a Ring Star Problem Generalization (Q2883580) (← links)
- The Granular Tabu Search and Its Application to the Vehicle-Routing Problem (Q2884563) (← links)
- A Set-Covering-Based Heuristic Approach for Bin-Packing Problems (Q2892273) (← links)
- Algorithms for the Bin Packing Problem with Conflicts (Q2899071) (← links)
- A Metaheuristic Approach for the Vertex Coloring Problem (Q2901013) (← links)
- Robust train routing and online re-scheduling (Q2917284) (← links)
- 04. Solution of the Train Platforming Problem (Q2917365) (← links)
- Solving a Real-World Train Unit Assignment Problem (Q2917370) (← links)
- The Recoverable Robust Two-Level Network Design Problem (Q2942678) (← links)
- A Reduced-Cost Iterated Local Search Heuristic for the Fixed-Charge Transportation Problem (Q2942705) (← links)
- A survey on vertex coloring problems (Q3002686) (← links)
- Worst-case analysis of greedy algorithms for the subset-sum problem (Q3042877) (← links)
- (Q3048582) (← links)
- (Q3048611) (← links)
- A Polyhedral Approach to Simplified Crew Scheduling and Vehicle Scheduling Problems (Q3114703) (← links)
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem (Q3116647) (← links)
- Heuristic Algorithms for the Multiple Depot Vehicle Scheduling Problem (Q3134567) (← links)
- Models and Algorithms for the Train Unit Assignment Problem (Q3167609) (← links)
- Aircraft Sequencing Problems via a Rolling Horizon Algorithm (Q3167632) (← links)
- State Space Reduced Dynamic Programming for the Aircraft Sequencing Problem with Constrained Position Shifting (Q3195337) (← links)
- A Mixture of Dynamic Programming and Branch-and-Bound for the Subset-Sum Problem (Q3220352) (← links)
- An Algorithm for the Bottleneck Traveling Salesman Problem (Q3328310) (← links)
- (Q3368660) (← links)
- An Integer Linear Programming Local Search for Capacitated Vehicle Routing Problems (Q3564361) (← links)