The following pages link to Marco Antonio Boschetti (Q1751658):
Displaying 21 items.
- (Q336897) (redirect page) (← links)
- A Lagrangian heuristic for sprint planning in agile software development (Q336900) (← links)
- Algorithms for nesting with defects (Q406491) (← links)
- (Q839838) (redirect page) (← links)
- Exact methods for large-scale multi-period financial planning problems (Q839841) (← links)
- A dual ascent procedure for the set partitioning problem (Q955334) (← links)
- The two-dimensional finite bin packing problem. I: New lower bounds for the oriented case (Q1429289) (← links)
- The two-dimensional finite bin packing problem. II: New lower and upper bounds (Q1432017) (← links)
- Route relaxations on GPU for vehicle routing problems (Q1751660) (← links)
- New lower bounds for the three-dimensional finite bin packing problem (Q1827849) (← links)
- An exact algorithm for the simplified multiple depot crew scheduling problem (Q1888181) (← links)
- Matheuristics. Algorithms and implementations (Q2246150) (← links)
- Benders decomposition, Lagrangean relaxation and metaheuristic design (Q2271124) (← links)
- A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem (Q2643948) (← links)
- Using GPU Computing for Solving the Two-Dimensional Guillotine Cutting Problem (Q2830956) (← links)
- A Fully Distributed Lagrangean Solution for a Peer-to-Peer Overlay Network Design Problem (Q2899105) (← links)
- An Exact Algorithm for the Two-Dimensional Strip-Packing Problem (Q3098338) (← links)
- New upper bounds for the two-dimensional orthogonal non-guillotine cutting stock problem (Q4814179) (← links)
- A set covering based matheuristic for a real‐world city logistics problem (Q5246831) (← links)
- Matheuristics: survey and synthesis (Q6056873) (← links)
- Last‐mile delivery with drone and lockers (Q6196866) (← links)
