Linear-shaped partition problems (Q1577471)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Linear-shaped partition problems	scientific article

Statements

scholarly article

0 references

Linear-shaped partition problems (English)

0 references

0 references

0 references

Uriel G. Rothblum

0 references

Operations Research Letters

0 references

publication date

4 September 2000

0 references

zbMATH Keywords

shaped partition problem

0 references

polynomial-time solvability

0 references

vector partition problems

0 references

linear objectives

0 references

MaRDI profile type

MaRDI publication profile

0 references

Separable partitions

0 references

Optimal partitions having disjoint convex and conic hulls

0 references

Consecutive Optimizers for a Partitioning Problem with Applications to Optimal Inventory Groupings for Joint Replenishment

0 references

Partition polytopes over 1-dimensional points

0 references

The Pareto set of the partition bargaining problem

0 references

Geometric algorithms and combinatorial optimization.

0 references

Representations and characterizations of vertices of bounded-shape partition polytopes

0 references

A Polynomial Time Algorithm for Shaped Partition Problems

0 references

Directional-Quasi-Convexity, Asymmetric Schur-Convexity and Optimality of Consecutive Partitions

0 references

Geometry, complexity, and combinatorics of permutation polytopes

0 references

Cutting corners

0 references

0 references

full work available at URL

https://doi.org/10.1016/s0167-6377(99)00069-3

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/S0167-6377(99)00069-3

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1577471

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1577471&oldid=37355687"