The following pages link to Silvano Martello (Q193678):
Displaying 50 items.
- Optimistic MILP modeling of non-linear optimization problems (Q297051) (← links)
- Bin packing and cutting stock problems: mathematical models and exact algorithms (Q323473) (← links)
- Models and algorithms for packing rectangles into the smallest square (Q342053) (← links)
- A brand new cheating attempt: a case of usurped identity (Q503656) (← links)
- Heuristics for the general multiple non-linear knapsack problem (Q510935) (← 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)
- Jenő Egerváry: from the origins of the Hungarian algorithm to satellite communication (Q623798) (← links)
- (Q691400) (redirect page) (← links)
- Complexity and approximation of an area packing problem (Q691403) (← links)
- Recent advances on two-dimensional bin packing problems (Q697576) (← links)
- TSpack: A unified tabu search code for multi-dimensional bin packing problems (Q702723) (← links)
- Heuristic algorithms for the general nonlinear separable knapsack problem (Q709196) (← links)
- Balanced optimization problems (Q760338) (← links)
- Lower bounds and heuristic algorithms for the \(k_i\)-partitioning problem (Q819064) (← links)
- A case of plagiarism: Dănuţ Marcu (Q862818) (← links)
- Packing into the smallest square: worst-case analysis of lower bounds (Q865748) (← links)
- The selective travelling salesman problem (Q910347) (← links)
- An exact algorithm for large unbounded knapsack problems (Q913659) (← links)
- Lower bounds and reduction procedures for the bin packing problem (Q917446) (← links)
- A heuristic approach to the bus driver scheduling problem (Q1068719) (← links)
- Approximation schemes for the subset-sum problem: Survey and experimental analysis (Q1069445) (← links)
- Most and least uniform spanning trees (Q1087546) (← links)
- Optimal and canonical solutions of the change making problem (Q1141080) (← links)
- Solution of the zero-one multiple knapsack problem (Q1142701) (← links)
- Heuristic algorithms for the multiple knapsack problem (Q1148788) (← links)
- A bound and bound algorithm for the zero-one multiple knapsack problem (Q1155514) (← links)
- A note on 0.5-bounded greedy algorithms for the 0/1 knapsack problem (Q1208445) (← links)
- An upper bound for the zero-one knapsack problem and a branch and bound algorithm (Q1245074) (← links)
- Algorithm 37. Algorithm for the solution of the 0-1 single Knapsack problem (Q1251184) (← links)
- An algorithm for finding a minimal equivalent graph of a strongly connected digraph (Q1253667) (← links)
- On tightening 0-1 programs based on extensions of pure 0-1 knapsack and subset-sum problems (Q1265899) (← links)
- Reduction of the three-partition problem (Q1304381) (← links)
- A lower bound for the non-oriented two-dimensional bin packing problem (Q1348248) (← links)
- Exact and approximation algorithms for makespan minimization on unrelated parallel machines (Q1363647) (← links)
- The \(k\)-cardinality assignment problem (Q1363745) (← links)
- The bottleneck generalized assignment problem (Q1388853) (← links)
- A note on exact algorithms for the bottleneck generalized assignment problem (Q1388862) (← links)
- Upper bounds and algorithms for the maximum cardinality bin packing problem. (Q1399594) (← links)
- New trends in exact algorithms for the \(0-1\) knapsack problem (Q1569935) (← links)
- Logic based Benders' decomposition for orthogonal stock cutting problems (Q1652086) (← links)
- Relaxations and heuristics for the multiple non-linear separable knapsack problem (Q1652581) (← links)
- Surveys in operations research (Q1730527) (← 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)
- Algorithms for minimizing maximum lateness with unit length tasks and resource constraints (Q1803669) (← links)
- Approximation algorithm for the oriented two-dimensional bin packing problem (Q1806892) (← links)
- Two-dimensional packing problems: a survey (Q1847188) (← links)
