The following pages link to Silvano Martello (Q193678):
Displaying 50 items.
- Heuristic algorithms for the three-dimensional bin packing problem (Q1847192) (← links)
- Models and bounds for two-dimensional level packing problems (Q1888172) (← links)
- An exact algorithm for the dual bin packing problem (Q1892657) (← links)
- Minimizing the sum of weighted completion times with unrestricted weights (Q1902889) (← links)
- Open shop, satellite communication and a theorem by Egerváry (1931) (Q1919192) (← links)
- A look at the past and present of optimization - an editorial (Q1926685) (← links)
- Exact solution techniques for two-dimensional cutting and packing (Q2029021) (← links)
- The assignment and loading transportation problem (Q2029276) (← links)
- Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem (Q2030649) (← 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)
- Piecewise linear approximation of functions of two variables in MILP models (Q2270322) (← links)
- Editorial notes: 4OR for what purpose? (Q2464551) (← links)
- An optimization problem in the electricity market (Q2477620) (← links)
- Twelve surveys in operations research (Q2630815) (← links)
- Lower and upper bounds for the non-linear generalized assignment problem (Q2664280) (← links)
- Exact solution of the two-dimensional finite bin packing problem (Q2783932) (← links)
- An exact approach to the strip-packing problem (Q2884561) (← 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)
- Worst-case analysis of greedy algorithms for the subset-sum problem (Q3042877) (← links)
- (Q3059312) (← links)
- A Polyhedral Approach to Simplified Crew Scheduling and Vehicle Scheduling Problems (Q3114703) (← links)
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem (Q3116647) (← links)
- (Q3145801) (← links)
- A Mixture of Dynamic Programming and Branch-and-Bound for the Subset-Sum Problem (Q3220352) (← links)
- An Algorithm for the Bottleneck Traveling Salesman Problem (Q3328310) (← links)
- Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem (Q3466782) (← links)
- Assignment Problems (Q3531417) (← links)
- An Exact Algorithm for the Two-Constraint 0–1 Knapsack Problem (Q3637393) (← links)
- Algorithm 632: A program for the 0–1 multiple knapsack problem (Q3675904) (← links)
- Worst-case analysis of the differencing method for the partition problem (Q3750527) (← links)
- (Q3751373) (← links)
- (Q3751378) (← links)
- The Fixed Job Schedule Problem with Spread-Time Constraints (Q3779989) (← links)
- A New Algorithm for the 0-1 Knapsack Problem (Q3789335) (← links)
- The Fixed Job Schedule Problem with Working-Time Constraints (Q3826354) (← links)
- Technical Note—A Note on the Ingargiola-Korsh Algorithm for One-Dimensional Knapsack Problems (Q3888837) (← links)
- (Q3929530) (← links)
- Finding a minimum equivalent graph of a digraph (Q3944018) (← links)
- Approximation Algorithms for Fixed Job Schedule Problems (Q3990569) (← links)
- (Q3993418) (← links)
- (Q4149228) (← links)
- (Q4197626) (← links)
- The Delivery Man Problem and Cumulative Matroids (Q4285163) (← links)
- (Q4350084) (← links)
- Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems (Q4393124) (← links)
- (Q4398358) (← links)
- (Q4398377) (← links)
