553 results on '"Martello, Silvano"'
Search Results
2. Operational Research: Methods and Applications
3. 21 volumes for the 21st century
4. The quadratic knapsack problem with setup
5. An Iterated Dual Substitution Approach for Binary Integer Programming Problems under the Min-Max Regret Criterion
6. Exact Solution Techniques for Two-dimensional Cutting and Packing
7. Lagrangian matheuristics for the Quadratic Multiple Knapsack Problem
8. Sixty-one surveys in operations research
9. Preface
10. 2DPackLib: a two-dimensional cutting and packing library
11. Theory and applications in combinatorial optimization
12. Operational research: methods and applications
13. Lower and upper bounds for the non-linear generalized assignment problem
14. Algorithmic approaches to the multiple knapsack assignment problem
15. 4OR comes of age: Editorial note
16. Operational Research: methods and applications
17. Relaxations and heuristics for the multiple non-linear separable knapsack problem
18. The traveling salesman problem with pickups, deliveries, and draft limits
19. An Exact Algorithm for the Two-Constraint 0-1 Knapsack Problem
20. Logic based Benders' decomposition for orthogonal stock cutting problems
21. A Polyhedral Approach to Simplified Crew Scheduling and Vehicle Scheduling Problems
22. The Three-Dimensional Bin Packing Problem
23. Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
24. Optimal Scheduling of a Multiunit Hydro Power Station in a Short-Term Planning Horizon
25. Exact Solution of the Two-Dimensional Finite Bin Packing Problem
26. Surveys in operations research
27. BPPLIB: a library for bin packing and cutting stock problems
28. Sweet sixteen
29. Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems
30. Emerging applications, models and algorithms in combinatorial optimization
31. Models and algorithms for packing rectangles into the smallest square
32. Bin Packing Approximation Algorithms: Survey and Classification
33. Neighborhood Search Algorithm for the Guillotine Non-Oriented Two-Dimensional Bin Packing Problem
34. Scatter Search Algorithms for Identical Parallel Machine Scheduling Problems
35. Comments on: A comparative study of time aggregation techniques in relation to power capacity-expansion modeling
36. A brand new cheating attempt: a case of usurped identity
37. Twelve surveys in operations research
38. An Iterated Dual Substitution Approach for Binary Integer Programming Problems Under the Min-Max Regret Criterion
39. Lagrangian matheuristics for the Quadratic Multiple Knapsack Problem
40. Knapsack problems — An overview of recent advances. Part I: Single knapsack problems
41. Knapsack problems — An overview of recent advances. Part II: Multiple, multidimensional, and quadratic knapsack problems
42. Metaheuristic Algorithms for the Strip Packing Problem
43. An Iterated Dual Substitution Approach for Binary Integer Programming Problems Under the Min-Max Regret Criterion
44. An Iterated Dual Substitution Approach for Binary Integer Programming Problems Under the Min-Max Regret Criterion
45. Heuristic and exact algorithms for the interval min-max regret knapsack problem
46. An annotated bibliography of combined routing and loading problems
47. Bin Packing Approximation Algorithms: Combinatorial Analysis
48. The dirty dozen of 4OR
49. Efficient Two-Dimensional Packing Algorithms for Mobile WiMAX
50. Preface
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.