Pages that link to "Item:Q2634938"
From MaRDI portal
The following pages link to Dual-feasible functions for integer programming and combinatorial optimization. Basics, extensions and applications (Q2634938):
Displaying 15 items.
- Bin packing and cutting stock problems: mathematical models and exact algorithms (Q323473) (← links)
- A hybrid feasibility constraints-guided search to the two-dimensional bin packing problem with due dates (Q1754152) (← links)
- Constructing general dual-feasible functions (Q1785396) (← links)
- Exact solution techniques for two-dimensional cutting and packing (Q2029021) (← links)
- Number of bins and maximum lateness minimization in two-dimensional bin packing (Q2029951) (← links)
- Dual-feasible functions for integer programming and combinatorial optimization: algorithms, characterizations, and approximations (Q2064286) (← links)
- A lookahead matheuristic for the unweighed variable-sized two-dimensional bin packing problem (Q2077966) (← links)
- Structure and interpretation of dual-feasible functions (Q2413164) (← links)
- Single batch machine scheduling with dual setup times for autoclave molding manufacturing (Q2668803) (← links)
- Software for Cut-Generating Functions in the Gomory–Johnson Model and Beyond (Q2819232) (← links)
- Equivariant perturbation in Gomory and Johnson's infinite group problem (V). Software for the continuous and discontinuous 1-row case (Q4637826) (← links)
- Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem (Q5085469) (← links)
- Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems (Q5139850) (← links)
- (Q5701860) (← links)
- A branch, bound and remember algorithm for maximizing the production rate in the simple assembly line balancing problem (Q6568392) (← links)
