The following pages link to Paolo Toth (Q181212):
Displaying 50 items.
- (Q228559) (redirect page) (← links)
- (Q336543) (redirect page) (← links)
- A new lower bound for curriculum-based course timetabling (Q336544) (← links)
- On exact solutions for the minmax regret spanning tree problem (Q337033) (← links)
- A two-phase hybrid heuristic algorithm for the capacitated location-routing problem (Q339543) (← links)
- (Q400002) (redirect page) (← links)
- On the optimal design of water distribution networks: a practical MINLP approach (Q400003) (← links)
- An exact approach for the vertex coloring problem (Q429677) (← links)
- An integer linear programming based heuristic for the capacitated \(m\)-ring-star problem (Q439317) (← links)
- A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size (Q439486) (← links)
- (Q510912) (redirect page) (← links)
- Timetable optimization for high-speed trains at Chinese railways (Q510913) (← links)
- (Q587826) (redirect page) (← links)
- A heuristic procedure for the capacitated \(m\)-ring-star problem (Q613432) (← links)
- Models, relaxations and exact approaches for the capacitated vehicle routing problem (Q697581) (← links)
- Balanced optimization problems (Q760338) (← links)
- Improved rolling horizon approaches to the aircraft sequencing problem (Q892901) (← links)
- An exact algorithm for large unbounded knapsack problems (Q913659) (← links)
- Lower bounds and reduction procedures for the bin packing problem (Q917446) (← links)
- Recent advances in vehicle routing exact algorithms (Q926561) (← links)
- A column generation approach to train timetabling on a corridor (Q941001) (← links)
- Exact algorithms for routing problems under vehicle capacity constraints (Q970191) (← links)
- Non-cyclic train timetabling and comparability graphs (Q974988) (← links)
- Variable neighborhood search for the cost constrained minimum label spanning tree and label constrained minimum spanning tree problems (Q976011) (← links)
- An electromagnetism metaheuristic for the unicost set covering problem (Q976443) (← links)
- An ILP improvement procedure for the open vehicle routing problem (Q991364) (← links)
- Models and heuristic algorithms for a weighted vertex coloring problem (Q1038841) (← links)
- A heuristic approach to the bus driver scheduling problem (Q1068719) (← links)
- Approximation schemes for the subset-sum problem: Survey and experimental analysis (Q1069445) (← links)
- Most and least uniform spanning trees (Q1087546) (← links)
- Primal-dual algorithms for the assignment problem (Q1095790) (← links)
- A new dominance procedure for combinatorial optimization problems (Q1109683) (← links)
- A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls (Q1124810) (← links)
- Dynamic programming algorithms for the zero-one knapsack problem (Q1138485) (← links)
- Optimal and canonical solutions of the change making problem (Q1141080) (← links)
- Contributions to the quadratic assignment problem (Q1142700) (← links)
- Solution of the zero-one multiple knapsack problem (Q1142701) (← links)
- Heuristic algorithms for the multiple knapsack problem (Q1148788) (← links)
- Algorithm for the solution of the bottleneck assignment problem (Q1148790) (← links)
- A bound and bound algorithm for the zero-one multiple knapsack problem (Q1155514) (← links)
- An additive bounding procedure for the asymmetric travelling salesman problem (Q1184344) (← links)
- A note on 0.5-bounded greedy algorithms for the 0/1 knapsack problem (Q1208445) (← links)
- An upper bound for the zero-one knapsack problem and a branch and bound algorithm (Q1245074) (← links)
- Algorithm 37. Algorithm for the solution of the 0-1 single Knapsack problem (Q1251184) (← links)
- On tightening 0-1 programs based on extensions of pure 0-1 knapsack and subset-sum problems (Q1265899) (← links)
- Exact and approximation algorithms for makespan minimization on unrelated parallel machines (Q1363647) (← links)
- Algorithms for railway crew management (Q1365052) (← links)
- The bottleneck generalized assignment problem (Q1388853) (← links)
- A note on exact algorithms for the bottleneck generalized assignment problem (Q1388862) (← links)
- Models and algorithms for a staff scheduling problem (Q1424308) (← links)
