On the public citation graph
Optimal partitions having disjoint convex and conic hulls
0 signed · 70 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1016/b978-0-12-566780-7.50007-6openalex-snapshot
Partitioning, Spectra and Linear Programming
inferredcites →https://doi.org/10.1057/jors.1987.94openalex-snapshot
Theory of Linear and Integer Programming
inferredcites →https://doi.org/10.1137/0603056openalex-snapshot
An Algorithm for Partitioning the Nodes of a Graph
inferredcites →https://doi.org/10.1147/rd.175.0420openalex-snapshot
Lower Bounds for the Partitioning of Graphs
inferredcites →https://doi.org/10.1287/opre.30.5.1018openalex-snapshot
Technical Note—A Partitioning Problem with Additive Objective with an Application to Optimal Inventory Groupings for Joint Replenishment
inferredcites →https://doi.org/10.1287/opre.33.4.820openalex-snapshot
Consecutive Optimizers for a Partitioning Problem with Applications to Optimal Inventory Groupings for Joint Replenishment
inferredcites →https://doi.org/10.2307/2008156openalex-snapshot
Progress in Combinatorial Optimization.
inferredcites →https://doi.org/10.2307/253980openalex-snapshot
Theory of Linear and Integer Programming
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/1520-6750(200009)47:6<531::aid-nav6>3.0.co;2-kopenalex-snapshot
Explicit solution of partitioning problems over a 1-dimensional parameter space
inferred← citeshttps://doi.org/10.1002/nav.20142openalex-snapshot
Bin‐packing problem with concave costs of bin utilization
inferred← citeshttps://doi.org/10.1006/eujc.1997.0145openalex-snapshot
Enumerating Consecutive and Nested Partitions for Graphs
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_94openalex-snapshot
Convex Discrete Optimization
inferred← citeshttps://doi.org/10.1007/978-3-319-59605-1_12openalex-snapshot
Optimal Partitioning Which Maximizes the Weighted Sum of Products
inferred← citeshttps://doi.org/10.1007/978-3-319-89920-6_6openalex-snapshot
Stable Clusterings and the Cones of Outer Normals
inferred← citeshttps://doi.org/10.1007/978-3-642-59051-1_1openalex-snapshot
Probability Models for Convex Clusters
inferred← citeshttps://doi.org/10.1007/bf01073852openalex-snapshot
Explicit representation of the two-dimensional section of a production possibility set
inferred← citeshttps://doi.org/10.1007/s00283-014-9448-2openalex-snapshot
Geometric Clustering for the Consolidation of Farmland and Woodland
inferred← citeshttps://doi.org/10.1007/s00454-001-0069-0openalex-snapshot
Momentopes, the Complexity of Vector Partitioning, and Davenport—Schinzel Sequences
inferred← citeshttps://doi.org/10.1007/s00454-004-1138-yopenalex-snapshot
Convex Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/s10878-006-7911-5openalex-snapshot
One-dimensional optimal bounded-shape partitions for Schur convex sum objective functions
inferred← citeshttps://doi.org/10.1007/s10878-006-8209-3openalex-snapshot
Strongly 2-shape-sortability of vector partitions
inferred← citeshttps://doi.org/10.1007/s10878-009-9263-4openalex-snapshot
On the number of separable partitions
inferred← citeshttps://doi.org/10.1007/s10878-010-9305-yopenalex-snapshot
On the vertex characterization of single-shape partition polytopes
inferred← citeshttps://doi.org/10.1007/s10878-012-9536-1openalex-snapshot
Are there more almost separable partitions than separable partitions?
inferred← citeshttps://doi.org/10.1007/s10898-005-3844-2openalex-snapshot
A Polytope Approach to the Optimal Assembly Problem
inferred← citeshttps://doi.org/10.1007/springerreference_72172openalex-snapshot
Convex Discrete Optimization
inferred← citeshttps://doi.org/10.1016/0012-365x(95)00146-nopenalex-snapshot
Localizing combinatorial properties of partitions
inferred← citeshttps://doi.org/10.1016/0166-218x(93)e0173-vopenalex-snapshot
Optimal separable partitioning in the plane
inferred← citeshttps://doi.org/10.1016/0377-2217(94)90059-0openalex-snapshot
The general multi-retailer EOQ problem with vehicle routing costs
inferred← citeshttps://doi.org/10.1016/j.cor.2007.01.005openalex-snapshot
Biclustering in data mining
inferred← citeshttps://doi.org/10.1016/j.dam.2006.06.012openalex-snapshot
Sphere-separable partitions of multi-parameter elements
inferred← citeshttps://doi.org/10.1016/j.dam.2007.05.012openalex-snapshot
Counting disjoint 2-partitions for points in the plane
inferred← citeshttps://doi.org/10.1016/j.disc.2012.10.025openalex-snapshot
Sortabilities of partition properties in multi-dimensional parameter spaces
inferred← citeshttps://doi.org/10.1016/j.disopt.2016.06.001openalex-snapshot
Efficient solutions for weight-balanced partitioning problems
inferred← citeshttps://doi.org/10.1016/j.disopt.2024.100825openalex-snapshot
Circuits in extended formulations
inferred← citeshttps://doi.org/10.1016/j.ejor.2017.04.018openalex-snapshot
Constrained clustering via diagrams: A unified theory and its application to electoral district design
inferred← citeshttps://doi.org/10.1016/j.ejor.2017.04.054openalex-snapshot
An LP-based k-means algorithm for balancing weighted point sets
inferred← citeshttps://doi.org/10.1016/j.jpaa.2008.11.033openalex-snapshot
Convex integer maximization via Graver bases
inferred← citeshttps://doi.org/10.1016/j.laa.2014.01.007openalex-snapshot
Convex integer optimization by constantly many linear counterparts
inferred← citeshttps://doi.org/10.1016/s0012-365x(02)00527-7openalex-snapshot
Sortability of vector partitions
inferred← citeshttps://doi.org/10.1016/s0024-3795(97)10092-1openalex-snapshot
Representations and characterizations of vertices of bounded-shape partition polytopes
inferred← citeshttps://doi.org/10.1016/s0166-218x(01)00326-2openalex-snapshot
Vertex characterization of partition polytopes of bipartitions and of planar point sets
inferred← citeshttps://doi.org/10.1016/s0167-6377(99)00069-3openalex-snapshot
Linear-shaped partition problems
inferred← citeshttps://doi.org/10.1023/a:1009737108224openalex-snapshot
Sortabilities of Partition Properties
inferred← citeshttps://doi.org/10.1023/a:1022417803474openalex-snapshot
An adaptive algorithm for vector partitioning
inferred← citeshttps://doi.org/10.1109/wkdd.2009.224openalex-snapshot
Bicluster Algorithm and Used in Market Analysis
inferred← citeshttps://doi.org/10.1137/110832707openalex-snapshot
On Optimal Weighted Balanced Clusterings: Gravity Bodies and Power Diagrams
inferred← citeshttps://doi.org/10.1137/s1052623494272399openalex-snapshot
Optimality of Nested Partitions and Its Application to Cluster Analysis
inferred← citeshttps://doi.org/10.1137/s1052623497344002openalex-snapshot
A Polynomial Time Algorithm for Shaped Partition Problems
inferred← citeshttps://doi.org/10.1287/ijoo.2019.0031openalex-snapshot
Spatial Separability in Hub Location Problems with an Application to Brain Connectivity Networks
inferred← citeshttps://doi.org/10.1287/ijoo.2022.0074openalex-snapshot
An Algorithm for the Separation-Preserving Transition of Clusterings
inferred← citeshttps://doi.org/10.1287/mnsc.37.11.1497openalex-snapshot
Rejoinder to “Comments on One-Warehouse Multiple Retailer Systems with Vehicle Routing Costs”
inferred← citeshttps://doi.org/10.1287/moor.21.3.540openalex-snapshot
Directional-Quasi-Convexity, Asymmetric Schur-Convexity and Optimality of Consecutive Partitions
inferred← citeshttps://doi.org/10.1287/moor.26.3.583.10587openalex-snapshot
The Vector Partition Problem for Convex Objective Functions
inferred← citeshttps://doi.org/10.1287/opre.2018.1779openalex-snapshot
Good Clusterings Have Large Volume
inferred← citeshttps://doi.org/10.1287/opre.39.1.130openalex-snapshot
Structured Partitioning Problems
inferred← citeshttps://doi.org/10.1287/opre.39.2.233openalex-snapshot
Multi-Item Replenishment and Storage Problem (MIRSP): Heuristics and Bounds
inferred← citeshttps://doi.org/10.1287/opre.39.3.443openalex-snapshot
Capacitated Two-Stage Multi-Item Production/Inventory Model with Joint Setup Costs
inferred← citeshttps://doi.org/10.1287/opre.40.2.384openalex-snapshot
The Joint Replenishment Problem with General Joint Cost Structures
inferred← citeshttps://doi.org/10.1287/opre.42.4.709openalex-snapshot
Optimality of Monotone Assemblies for Coherent Systems Composed of Series Modules
inferred← citeshttps://doi.org/10.1287/opre.43.3.500openalex-snapshot
Optimal Partitioning Which Maximizes the Sum of the Weighted Averages
inferred← citeshttps://doi.org/10.3233/978-1-60750-718-5-183openalex-snapshot
Convex Discrete Optimization
inferred← citeshttps://doi.org/10.48550/arxiv.1208.5639openalex-snapshot
Convex Integer Optimization by Constantly Many Linear Counterparts
inferred← citeshttps://doi.org/10.48550/arxiv.1308.4004openalex-snapshot
A balanced k-means algorithm for weighted point sets
inferred← citeshttps://doi.org/10.48550/arxiv.1503.06877openalex-snapshot
Efficient solutions for weight-balanced partitioning problems
inferred← citeshttps://doi.org/10.48550/arxiv.math/9704226openalex-snapshot
A Polynomial Time Algorithm for Vertex Enumeration and Optimization over Shaped Partition Polytopes
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.