On a 2-dimensional equipartition problem
DOI10.1016/S0377-2217(97)00429-3zbMATH Open0944.90095OpenAlexW2034415102MaRDI QIDQ1806658FDOQ1806658
Authors: Francesco Conti, Federico Malucelli, Sara Nicoloso, Bruno Simeone 
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
Recommendations
- Two-Dimensional partitioning problems
- On two partition problems
- On a Problem of Partitions
- The partition problem for equifacetal simplices
- Two-dimensional partitions
- 2K2-Partition Problem
- scientific article; zbMATH DE number 4101263
- On the two-dimensional Davenport-Schinzel problem
- On the equipartition of plane convex bodies and convex polygons
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Abstract computational complexity for mathematical programming problems (90C60)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Tabu Search—Part I
- Efficient algorithms for interval graphs and circular-arc graphs
- A Linear Tree Partitioning Algorithm
- Most uniform path partitioning and its use in image processing
- Title not available (Why is that?)
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
- The dissection of rectangles into squares
- Tabu Search—Part II
- The solution of two-stage guillotine cutting stock problems having extremely varying order demands
- Max-Min Tree Partitioning
- Max-min partitioning of grid graphs into connected components
- A Shifting Algorithm for Min-Max Tree Partitioning
- Efficient implementation of a shifting algorithm
- Shifting algorithms for tree partitioning with general weighting functions
- Fair dissections of spiders, worms, and caterpillars
- Partitioning a matrix to minimize the maximum cost
Cited In (5)
- A polynomial-time algorithm for max-min partitioning of ladders
- The equipartition polytope. I: Formulations, dimension and basic facets
- Path equipartition in the Chebyshev norm
- Max-min partitioning of grid graphs into connected components
- Partitioning a matrix with non-guillotine cuts to minimize the maximum cost
This page was built for publication: On a 2-dimensional equipartition problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1806658)
