On the public citation graph

Sequential convexification in reverse convex and disjunctive programming

https://doi.org/10.1007/bf01587096
0 signed · 28 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf01442883openalex-snapshot
Reverse convex programming
inferredcites →https://doi.org/10.1007/bf02591693openalex-snapshot
Nondifferentiable reverse convex programs and facetial convexity cuts via a disjunctive characterization
inferredcites →https://doi.org/10.1007/bfb0121051openalex-snapshot
On the facial structure of scheduling polyhedra
inferredcites →https://doi.org/10.1016/0166-218x(84)90087-8openalex-snapshot
Extensions of a theorem of Balas
inferredcites →https://doi.org/10.1016/0898-1221(77)90071-2openalex-snapshot
Nonlinear Programming Analysis and Methods
inferredcites →https://doi.org/10.1016/s0166-218x(98)00136-xopenalex-snapshot
Disjunctive programming: Properties of the convex hull of feasible points
inferredcites →https://doi.org/10.1016/s0167-5060(08)70342-xopenalex-snapshot
Disjunctive Programming
inferredcites →https://doi.org/10.1137/0304021openalex-snapshot
Iterative Solution of Nonlinear Optimal Control Problems
inferredcites →https://doi.org/10.1137/0318018openalex-snapshot
A Cutting-Plane Game for Facial Disjunctive Programs
inferredcites →https://doi.org/10.1515/9781400873173openalex-snapshot
Convex Analysis

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/3-540-45586-8_2openalex-snapshot
Projection and Lifting in Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4615-2025-2_4openalex-snapshot
D.C. Optimization: Theory, Methods and Algorithms
inferred← citeshttps://doi.org/10.1007/978-1-4757-3403-4_2openalex-snapshot
About Disjunctive Optimization
inferred← citeshttps://doi.org/10.1007/978-3-030-00148-3_3openalex-snapshot
Sequential Convexification of Disjunctive Sets
inferred← citeshttps://doi.org/10.1007/bf01581273openalex-snapshot
A lift-and-project cutting plane algorithm for mixed 0–1 programs
inferred← citeshttps://doi.org/10.1007/bf02192279openalex-snapshot
D.C. Representability of closed sets in reflexive Banach spaces and applications to optimization problems
inferred← citeshttps://doi.org/10.1007/bf02614516openalex-snapshot
On the degree and separability of nonconvexity and applications to optimization problems
inferred← citeshttps://doi.org/10.1007/s10107-010-0371-9openalex-snapshot
Convex relaxations of non-convex mixed integer quadratically constrained programs: extended formulations
inferred← citeshttps://doi.org/10.1007/s10479-005-3969-1openalex-snapshot
Projection, Lifting and Extended Formulation in Integer and Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/s10898-017-0499-8openalex-snapshot
Solving linear optimization over arithmetic constraint formula
inferred← citeshttps://doi.org/10.1016/j.dss.2012.08.012openalex-snapshot
A demand-responsive decision support system for coal transportation
inferred← citeshttps://doi.org/10.1016/j.ejor.2011.07.018openalex-snapshot
A hierarchy of relaxations for linear generalized disjunctive programming
inferred← citeshttps://doi.org/10.1016/j.ejor.2019.05.033openalex-snapshot
On solving two-stage distributionally robust disjunctive programs with a general ambiguity set
inferred← citeshttps://doi.org/10.1016/s0166-218x(01)00340-7openalex-snapshot
Lift-and-project for Mixed 0–1 programming: recent progress
inferred← citeshttps://doi.org/10.1023/a:1020204022612openalex-snapshot
inferred← citeshttps://doi.org/10.1080/02331939008843617openalex-snapshot
Stability in disjunctive linear optimization I: continuity of the feasible set
inferred← citeshttps://doi.org/10.1080/02331939408844006openalex-snapshot
Stability in disjunctive optimization II:continuity of the feasible and optimal set
inferred← citeshttps://doi.org/10.1287/moor.2021.0281openalex-snapshot
Compact Extended Formulations for Low-Rank Functions with Indicator Variables
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.