Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

An adaptive algorithm for vector partitioning

From MaRDI portal
Publication:1810893
Jump to:navigation, search

DOI10.1023/A:1022417803474zbMath1047.90057MaRDI QIDQ1810893

Komei Fukuda, Shmuel Onn, Vera Rosta

Publication date: 9 June 2003

Published in: Journal of Global Optimization (Search for Journal in Brave)


zbMATH Keywords

combinatorial optimizationoutput-sensitivepartition polytopepolytope diametervertex enumeration


Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Combinatorial optimization (90C27)


Related Items (3)

Stable Clusterings and the Cones of Outer Normals ⋮ Good Clusterings Have Large Volume ⋮ Convex integer maximization via Graver bases




This page was built for publication: An adaptive algorithm for vector partitioning

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1810893&oldid=14171218"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 10:25.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki