The following pages link to Manuel Iori (Q323472):
Displaying 50 items.
- Bin packing and cutting stock problems: mathematical models and exact algorithms (Q323473) (← links)
- Exact algorithms for the double vehicle routing problem with multiple stacks (Q342039) (← links)
- A destroy and repair algorithm for the bike sharing rebalancing problem (Q342356) (← links)
- Lower and upper bounds for the bin packing problem with fragile objects (Q406499) (← links)
- Models and algorithms for fair layout optimization problems (Q610957) (← links)
- Routing problems with loading constraints (Q610992) (← links)
- Rejoinder on: Routing problems with loading constraints (Q610995) (← links)
- An aggregate label setting policy for the multi-objective shortest path problem (Q613476) (← links)
- Heuristic and exact algorithms for the multi-pile vehicle routing problem (Q657060) (← links)
- Metaheuristic algorithms for combinatorial optimization problems. (Abstract of thesis) (Q816435) (← links)
- Lower bounds and heuristic algorithms for the \(k_i\)-partitioning problem (Q819064) (← links)
- Ant colony optimization for the two-dimensional loading vehicle routing problem (Q955597) (← links)
- The single-finger keyboard layout problem (Q1025249) (← links)
- Metaheuristics for vehicle routing problems with three-dimensional loading constraints (Q1038331) (← links)
- Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading (Q1046716) (← links)
- A scalable exact algorithm for the vertex \(p\)-center problem (Q1634076) (← links)
- Logic based Benders' decomposition for orthogonal stock cutting problems (Q1652086) (← links)
- A heuristic algorithm for a single vehicle static bike sharing rebalancing problem (Q1652142) (← links)
- Minimizing \(\mathrm{CO}_2\) emissions in a practical daily carpooling problem (Q1652217) (← links)
- Exact algorithms for the bin packing problem with fragile objects (Q1662100) (← links)
- Scheduling cleaning activities on trains by minimizing idle times (Q1707827) (← links)
- Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines (Q1711446) (← links)
- BPPLIB: a library for bin packing and cutting stock problems (Q1746064) (← links)
- Mathematical models and decomposition methods for the multiple knapsack problem (Q1755383) (← links)
- Exact solution techniques for two-dimensional cutting and packing (Q2029021) (← links)
- Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization (Q2029254) (← links)
- On solving the time window assignment vehicle routing problem via iterated local search (Q2056911) (← links)
- New exact techniques applied to a class of network flow formulations (Q2061874) (← links)
- 2DPackLib: a two-dimensional cutting and packing library (Q2115308) (← 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)
- Arc flow formulations based on dynamic programming: theoretical foundations and applications (Q2239929) (← links)
- Solution methods for scheduling problems with sequence-dependent deterioration and maintenance events (Q2242370) (← links)
- A branch-and-price algorithm for the temporal bin packing problem (Q2337386) (← links)
- Friendly bin packing instances without integer round-up property (Q2340275) (← links)
- Novel formulations and modeling enhancements for the dynamic berth allocation problem (Q2424775) (← links)
- Shortest paths in piecewise continuous time-dependent networks (Q2517795) (← links)
- A hybrid genetic algorithm for the two-dimensional single large object placement problem (Q2643949) (← links)
- Scheduling jobs with release dates on identical parallel machines by minimizing the total weighted completion time (Q2664351) (← links)
- Exact solution of network flow models with strong relaxations (Q2689828) (← links)
- Algorithms for the Bin Packing Problem with Conflicts (Q2899071) (← links)
- Heuristic and Exact Algorithms for the Identical Parallel Machine Scheduling Problem (Q2901015) (← links)
- An annotated bibliography of combined routing and loading problems (Q2929886) (← links)
- Combinatorial Benders' Cuts for the Strip Packing Problem (Q2935306) (← links)
- A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading (Q3057131) (← links)
- Mathematical Models and Search Algorithms for the Capacitated <i>p</i>-Center Problem (Q3386776) (← links)
- Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem (Q3466782) (← links)
- (Q4452972) (← links)
- Non-Elementary Formulations for Single Vehicle Routing Problems with Pickups and Deliveries (Q4602474) (← links)
- The Bin Packing Problem with Precedence Constraints (Q4909118) (← links)
