The following pages link to Valentina Cacchiani (Q291068):
Displayed 31 items.
- Single-commodity robust network design with finite and hose demand sets (Q291071) (← links)
- Single-commodity robust network design problem: complexity, instances and heuristic solutions (Q296864) (← links)
- (Q336470) (redirect page) (← links)
- A hybrid approach to beam angle optimization in intensity-modulated radiation therapy (Q336473) (← links)
- A new lower bound for curriculum-based course timetabling (Q336544) (← links)
- A set-covering based heuristic algorithm for the periodic vehicle routing problem (Q406496) (← links)
- The table placement problem: a research challenge at the EWI 2007 (Q458951) (← links)
- Timetable optimization for high-speed trains at Chinese railways (Q510913) (← links)
- A column generation approach to train timetabling on a corridor (Q941001) (← links)
- Non-cyclic train timetabling and comparability graphs (Q974988) (← links)
- Models and algorithms for combinatorial optimization problems arising in railway applications (Q1022444) (← links)
- A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs (Q1753510) (← links)
- Nominal and robust train timetabling problems (Q1926692) (← links)
- Finding cliques of maximum weight on a generalization of permutation graphs (Q1940437) (← links)
- An iterative heuristic for passenger-centric train timetabling with integrated adaption times (Q2147000) (← links)
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← links)
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems (Q2147011) (← links)
- Models and algorithms for the traveling salesman problem with time-dependent service times (Q2294625) (← links)
- A branch-and-cut-and-price algorithm for the multi-trip separate pickup and delivery problem with time windows at customers and facilities (Q2315637) (← links)
- An overview of curriculum-based course timetabling (Q2355018) (← links)
- Rejoinder on: ``An overview of curriculum-based course timetabling'' (Q2355019) (← links)
- On integer polytopes with few nonzero vertices (Q2376738) (← links)
- A Lagrangian heuristic for a train-unit assignment problem (Q2446297) (← links)
- Solving a real-world train-unit assignment problem (Q2638371) (← links)
- An integer linear programming model for integrated train stop planning and timetabling with time-dependent passenger demand (Q2669585) (← links)
- Recoverable Robustness for Railway Rolling Stock Planning (Q2917356) (← links)
- Solving a Real-World Train Unit Assignment Problem (Q2917370) (← links)
- Models and Algorithms for the Train Unit Assignment Problem (Q3167609) (← links)
- Models and Algorithms for Robust Network Design with Several Traffic Scenarios (Q3167631) (← links)
- A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph (Q4599315) (← links)
- A matheuristic algorithm for the pollution and energy minimization traveling salesman problems (Q6079856) (← links)