Pages that link to "Item:Q5939229"
From MaRDI portal
The following pages link to Lower bounds and algorithms for the 2-dimensional vector packing problem (Q5939229):
Displaying 28 items.
- Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem (Q297181) (← links)
- A single machine scheduling problem with two-dimensional vector packing constraints (Q319018) (← links)
- An optimization-based heuristic for the machine reassignment problem (Q338859) (← links)
- Fast machine reassignment (Q338866) (← links)
- Vector bin packing with heterogeneous bins: application to the machine reassignment problem (Q338869) (← links)
- Bin packing and related problems: general arc-flow formulation with graph compression (Q342316) (← links)
- Consistent neighborhood search for one-dimensional bin packing and two-dimensional vector packing (Q342540) (← links)
- Approximation schemes for generalized two-dimensional vector packing with application to data placement (Q414421) (← links)
- Improving the efficiency of a best-first bottom-up approach for the constrained 2D cutting problem (Q439644) (← links)
- Resource allocation algorithms for virtualized service hosting platforms (Q666218) (← links)
- Stabilized branch-and-price algorithms for vector packing problems (Q724108) (← links)
- Properties of some ILP formulations of a class of partitioning problems (Q1270767) (← links)
- A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function (Q1753400) (← links)
- An approximation algorithm with absolute worst-case performance ratio 2 for two-dimensional vector packing (Q1870001) (← links)
- Solving bin packing problems using VRPSolver models (Q2033390) (← links)
- Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups (Q2080827) (← links)
- Using VRPSolver to efficiently solve the \textsc{differential harvest problem} (Q2108125) (← links)
- A generic exact solver for vehicle routing and related problems (Q2196312) (← links)
- A branch-and-price algorithm for the two-dimensional vector packing problem (Q2329474) (← links)
- A branch-and-price algorithm for the temporal bin packing problem (Q2337386) (← links)
- A two-dimensional vector packing model for the efficient use of coil cassettes (Q2387252) (← links)
- Compact integer linear programming formulations for the temporal bin packing problem with fire-ups (Q2668727) (← links)
- An exact algorithm for two-dimensional vector packing problem with volumetric weight and general costs (Q2670556) (← links)
- Dual inequalities for stabilized column generation revisited (Q2806874) (← links)
- A Comparative Study of Multi-objective Evolutionary Algorithms for the Bi-objective 2-Dimensional Vector Packing Problem (Q2867106) (← links)
- Branch-Cut-and-Price for the Robust Capacitated Vehicle Routing Problem with Knapsack Uncertainty (Q5003707) (← links)
- Hybrid branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with time windows (Q6106578) (← links)
- Algorithms for the bin packing problem with scenarios (Q6646755) (← links)
