The following pages link to Alberto Ceselli (Q336981):
Displaying 46 items.
- Mathematical programming algorithms for bin packing problems with item fragmentation (Q336982) (← links)
- Exactly solving packing problems with fragmentation (Q342536) (← links)
- Modeling and solving profitable location and distribution problems (Q375987) (← links)
- Heuristics for static cloudlet location (Q510909) (← links)
- Column generation for the variable cost and size bin packing problem with fragmentation (Q510930) (← links)
- A branch\&price\&cut algorithm for the vehicle routing problem with intermediate replenishment facilities (Q510949) (← links)
- (Q591382) (redirect page) (← links)
- A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint (Q610980) (← links)
- A branch-and-price algorithm for the multi-depot heterogeneous-fleet pickup and delivery problem with soft time windows (Q892384) (← links)
- A computational evaluation of a general branch-and-price framework for capacitated network location problems (Q1026595) (← links)
- A branch-and-price algorithm for the two-dimensional level strip packing problem (Q1029564) (← links)
- Two exact algorithms for the capacitated \(p\)-median problem (Q1421050) (← links)
- Optimized assignment patterns in mobile edge cloud networks (Q1734851) (← links)
- Efficient algorithms for the double traveling salesman problem with multiple stacks (Q1762078) (← links)
- Optimization algorithms for resilient path selection in networks (Q2027082) (← links)
- A route decomposition approach for the single commodity split pickup and split delivery vehicle routing problem (Q2029263) (← links)
- Synchronized pickup and delivery problems with connecting FIFO stack (Q2056913) (← links)
- Dantzig-Wolfe reformulations for binary quadratic problems (Q2125570) (← links)
- Heuristic data-driven feasibility on integrated planning and scheduling (Q2216005) (← links)
- Rolling-horizon heuristics for capacitated stochastic inventory problems with forecast updates (Q2216006) (← links)
- Computational evaluation of data driven local search for MIP decompositions (Q2216010) (← links)
- A computational evaluation of online ATSP algorithms (Q2216020) (← links)
- A branch-and-cut-and-price algorithm for the electric vehicle routing problem with multiple technologies (Q2226503) (← links)
- Random sampling and machine learning to understand good decompositions (Q2288981) (← links)
- Combining very large scale and ILP based neighborhoods for a two-level location problem (Q2356178) (← links)
- Employee workload balancing by graph partitioning (Q2448894) (← links)
- Combined location and routing problems for drug distribution (Q2448896) (← links)
- Balanced compact clustering for efficient range queries in metric spaces (Q2449057) (← links)
- An optimization algorithm for a penalized knapsack problem (Q2466588) (← links)
- Automatic Dantzig-Wolfe reformulation of mixed integer programs (Q2515047) (← links)
- Distributed asynchronous column generation (Q2676290) (← links)
- Optimizing Time Slot Allocation in Single Operator Home Delivery Problems (Q2806900) (← links)
- Exactly solving a two-level location problem with modular node capacities (Q2892154) (← links)
- (Q3081840) (← links)
- A Branch-and-Price Algorithm for the Multilevel Generalized Assignment Problem (Q3392051) (← links)
- An Optimization Algorithm for the Ordered Open-End Bin-Packing Problem (Q3392181) (← links)
- Towards Mathematical Programming Methods for Predicting User Mobility in Mobile Networks (Q4596446) (← links)
- A branch‐and‐price algorithm for the capacitated <i>p</i>‐median problem (Q4680415) (← links)
- Exact Algorithms for Maximum Lifetime Data-Gathering Tree in Wireless Sensor Networks (Q5106396) (← links)
- Mathematical Programming Algorithms for Spatial Cloaking (Q5137955) (← links)
- Asynchronous Column Generation (Q5232580) (← links)
- A data driven Dantzig-Wolfe decomposition framework (Q6102860) (← links)
- On the impact of resource relocation in facing health emergencies (Q6167427) (← links)
- Mathematical programming for simultaneous feature selection and outlier detection under l1 norm (Q6565451) (← links)
- Mathematical programming and machine learning for a task allocation game (Q6619766) (← links)
- A polynomial-time dynamic programming algorithm for an optimal picking problem in automated warehouses (Q6620469) (← links)
