On a 2-dimensional equipartition problem
From MaRDI portal
Publication:1806658
DOI10.1016/S0377-2217(97)00429-3zbMath0944.90095OpenAlexW2034415102MaRDI QIDQ1806658
Bruno Simeone, Federico Malucelli, Francesco Conti, Sara Nicoloso
Publication date: 29 November 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(97)00429-3
Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Approximation methods and heuristics in mathematical programming (90C59)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient implementation of a shifting algorithm
- The solution of two-stage guillotine cutting stock problems having extremely varying order demands
- Most uniform path partitioning and its use in image processing
- Partitioning a matrix to minimize the maximum cost
- The dissection of rectangles into squares
- Shifting algorithms for tree partitioning with general weighting functions
- Max-Min Tree Partitioning
- A Shifting Algorithm for Min-Max Tree Partitioning
- Efficient algorithms for interval graphs and circular-arc graphs
- Tabu Search—Part I
- Tabu Search—Part II
- A Linear Tree Partitioning Algorithm
- Max-min partitioning of grid graphs into connected components
- Fair dissections of spiders, worms, and caterpillars
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
