The maximum diversity assortment selection problem
From MaRDI portal
Publication:2040441
DOI10.1007/S00186-021-00740-2zbMATH Open1471.90124OpenAlexW3159999966MaRDI QIDQ2040441FDOQ2040441
Authors: Felix Prause, Kai Hoppmann-Baum, Boris Defourny, Thorsten Koch 
Publication date: 14 July 2021
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00186-021-00740-2
Recommendations
combinatorial optimizationmixed integer programmingtwo-dimensional knapsack problemmaximum diversity problem
Cites Work
- Mathematical methods of organizing and planning production. English translation by Robert W. Campbell and W. H. Marlow
- Title not available (Why is that?)
- On genetic algorithms for the packing of polygons
- An improved typology of cutting and packing problems
- Extreme point-based heuristics for three-dimensional bin packing
- Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
- Error detecting and error correcting codes
- Partitioning procedures for solving mixed-variables programming problems. Reprint
- Generalized Benders decomposition
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- Multistage Cutting Stock Problems of Two and More Dimensions
- Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
- A typology of cutting and packing problems
- A population heuristic for constrained two-dimensional non-guillotine cutting
- Exact solution of the two-dimensional finite bin packing problem
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- Two-Dimensional Finite Bin-Packing Algorithms
- An Algorithm for Two-Dimensional Cutting Problems
- A skyline heuristic for the 2D rectangular packing and strip packing problems
- A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
- A Heuristic Programming Solution to a Nonlinear Cutting Stock Problem
- Data set generation for rectangular placement problems
- Heuristic approaches for the two- and three-dimensional knapsack packing problem
- Packing problems
- An exact algorithm for general, orthogonal, two-dimensional knapsack problems
- A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem
- An effective quasi-human based heuristic for solving the rectangle packing problem
- Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem
- A hybrid genetic algorithm for the two-dimensional single large object placement problem
- A tabu search algorithm for a two-dimensional non-guillotine cutting problem
- A new exact method for the two-dimensional orthogonal packing problem
- A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem
- A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces
- Effective nesting of rectangular parts in multiple rectangular sheets using genetic and heuristic algorithms
- New upper bounds for the two-dimensional orthogonal non-guillotine cutting stock problem
- A least wasted first heuristic algorithm for the rectangular packing problem
- The trim-loss and assortment problems: A survey
- An efficient deterministic heuristic for two-dimensional rectangular packing
- GRASP and path relinking for the max-min diversity problem
- Computational aspects of the maximum diversity problem
- Heuristic and Special Case Algorithms for Dispersion Problems
- Title not available (Why is that?)
- Tabu search and GRASP for the maximum diversity problem
- Iterated greedy for the maximum diversity problem
- A branch and bound algorithm for the maximum diversity problem
- Exact algorithms for large-scale unconstrained two and three staged cutting problems
- An Exact Algorithm for Higher-Dimensional Orthogonal Packing
- A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing
- Packing small boxes into a big box.
- Constrained two-dimensional cutting: an improvement of Christofides and Whitlock's exact algorithm
- Improving the efficiency of a best-first bottom-up approach for the constrained 2D cutting problem
- A GRASP algorithm for constrained two-dimensional non-guillotine cutting problems
- One-dimensional relaxations and LP bounds for orthogonal packing
- Hybrid heuristics for the maximum diversity problem
- Denser packings obtained in \(O(n \log \log n)\) time
- Combinatorial Benders' cuts for the strip packing problem
- Exact solution techniques for two-dimensional cutting and packing
- An iterative bidirectional heuristic placement algorithm for solving the two-dimensional knapsack packing problem
- Stochastic Algorithms: Foundations and Applications
Uses Software
This page was built for publication: The maximum diversity assortment selection problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2040441)
