Optimal partitions having disjoint convex and conic hulls-Reference-Cited by-同舟云学术

Optimal partitions having disjoint convex and conic hulls

Published:1992-02 Issue:1-3 Volume:54 Page:69-86
ISSN:0025-5610
Container-title:Mathematical Programming
language:en
Short-container-title:Mathematical Programming

Author:

Barnes E. R.,Hoffman A. J.,Rothblum Uriel G.

Publisher

Springer Science and Business Media LLC

Subject

General Mathematics,Software

Link

http://link.springer.com/content/pdf/10.1007/BF01586042.pdf

Reference12 articles.

1. E.R. Barnes, “An algorithm for partitioning the nodes of a graph,”SIAM Journal of Algebraic and Discrete Mathematics 3 (1982) 541–550.

2. E.R. Barnes, “Partitioning the nodes of a graph,” manuscript (1985).

3. E.R. Barnes and A.J. Hoffman, “Partitioning, spectra and linear programming,” in: W.E. Pulleyblank, ed.,Progress in Combinatorial Optimization (Academic Press, New York, 1984).

4. E.R. Barnes, A. Vannelli and J.O. Walker, “A new procedure for partitioning the nodes of a graph,” IBM Research Report RC 10561 (June 1984).

5. A.K. Chakravarty, J.B. Orlin and U.G. Rothblum, “A partitioning problem with additive objective with an application to optimal inventory groupings for joint replenishment,”Operations Research 30 (1982) 1018–1022.

Cited by 47 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Circuits in extended formulations;Discrete Optimization;2024-05

2. An Algorithm for the Separation-Preserving Transition of Clusterings;INFORMS Journal on Optimization;2023-01

3. Spatial Separability in Hub Location Problems with an Application to Brain Connectivity Networks;INFORMS Journal on Optimization;2020-10

4. Good Clusterings Have Large Volume;Operations Research;2019-01

5. Stable Clusterings and the Cones of Outer Normals;Operations Research Proceedings;2018