The following pages link to Silvano Martello (Q193678):
Displaying 19 items.
- Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems (Q4427380) (← links)
- (Q4452972) (← links)
- (Q4495176) (← links)
- The Three-Dimensional Bin Packing Problem (Q4530648) (← links)
- Algorithm 595: An Enumerative Algorithm for Finding Hamiltonian Circuits in a Directed Graph (Q4749863) (← links)
- Optimal Scheduling of Tasks on Identical Parallel Processors (Q4896446) (← links)
- (Q4902799) (← links)
- An Iterated Dual Substitution Approach for Binary Integer Programming Problems Under the Min-Max Regret Criterion (Q5057998) (← links)
- A framework for tightening 0–1 programs based on extensions of pure 0–1 KP and SS problems (Q5101409) (← links)
- Scatter Search Algorithms for Identical Parallel Machine Scheduling Problems (Q5302314) (← links)
- Erratum to “The Three-Dimensional Bin Packing Problem”: Robot-Packable and Orthogonal Variants of Packing Problems (Q5322133) (← links)
- A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints (Q5433189) (← links)
- Erratum: A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints (Q5449670) (← links)
- Bounds for the cardinality constrained \(P \|C_{max}\) problem (Q5939270) (← links)
- Comments on: ``A comparative study of time aggregation techniques in relation to power capacity-expansion modeling'' (Q5971041) (← links)
- Lagrangian matheuristics for the quadratic multiple knapsack problem (Q6041829) (← links)
- An Iterated Dual Substitution Approach for Binary Integer Programming Problems under the Min-Max Regret Criterion (Q6356023) (← links)
- Review: An annotated bibliography of combined routing and loading problems (Q6486685) (← links)
- Operational Research: Methods and Applications (Q6509328) (← links)
