On the public citation graph

A modified lift-and-project procedure

https://doi.org/10.1007/bf02614309
0 signed · 37 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/bf01581273openalex-snapshot
A lift-and-project cutting plane algorithm for mixed 0–1 programs
inferredcites →https://doi.org/10.1016/0166-218x(92)00190-wopenalex-snapshot
A hierarchy of relaxations and convex hull characterizations for mixed-integer zero—one programming problems
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.1090/dimacs/026/02openalex-snapshot
Polyhedral methods for the maximum clique problem
inferredcites →https://doi.org/10.1137/0403036openalex-snapshot
A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
inferredcites →https://doi.org/10.1137/0606047openalex-snapshot
Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
inferredcites →https://doi.org/10.1137/0801013openalex-snapshot
Cones of Matrices and Set-Functions and 0–1 Optimization
inferredcites →https://doi.org/10.1287/mnsc.42.9.1229openalex-snapshot
Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
inferredcites →https://doi.org/10.21236/ada298925openalex-snapshot
Polyhedral Methods for the Maximum Clique Problem,

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9780470400531.eorms0537openalex-snapshot
Disjunctive Inequalities: Applications And Extensions
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-0-387-35514-6_13openalex-snapshot
Semidefinite and Lagrangian Relaxations for Hard Combinatorial Problems
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_134openalex-snapshot
Disjunctive Programming
inferred← citeshttps://doi.org/10.1007/978-0-387-75714-8_12openalex-snapshot
Two-Stage Stochastic Mixed-Integer Programs: Algorithms and Insights
inferred← citeshttps://doi.org/10.1007/978-3-030-45771-6_7openalex-snapshot
Implementing Automatic Benders Decomposition in a Modern MIP Solver
inferred← citeshttps://doi.org/10.1007/978-3-030-54621-2_134-1openalex-snapshot
Disjunctive Programming
inferred← citeshttps://doi.org/10.1007/978-3-319-00795-3_2openalex-snapshot
Sparsity of Lift-and-Project Cutting Planes
inferred← citeshttps://doi.org/10.1007/978-3-319-11008-0_3openalex-snapshot
Linear Inequalities and Polyhedra
inferred← citeshttps://doi.org/10.1007/978-3-319-11008-0_5openalex-snapshot
Split and Gomory Inequalities
inferred← citeshttps://doi.org/10.1007/978-3-319-11008-0_7openalex-snapshot
Valid Inequalities for Structured Integer Programs
inferred← citeshttps://doi.org/10.1007/978-3-319-11008-0_8openalex-snapshot
Reformulations and Relaxations
inferred← citeshttps://doi.org/10.1007/s10107-004-0566-zopenalex-snapshot
The C3 Theorem and a D2 Algorithm for Large Scale Stochastic Mixed-Integer Programming: Set Convexification
inferred← citeshttps://doi.org/10.1007/s10107-009-0300-yopenalex-snapshot
On the separation of disjunctive cuts
inferred← citeshttps://doi.org/10.1007/s10107-016-1029-zopenalex-snapshot
Nonanticipative duality, relaxations, and formulations for chance-constrained stochastic programs
inferred← citeshttps://doi.org/10.1007/s10288-010-0140-xopenalex-snapshot
Enhanced mixed integer programming techniques and routing problems
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/s10479-020-03709-2openalex-snapshot
Reformulating the disjunctive cut generating linear program
inferred← citeshttps://doi.org/10.1007/s10589-014-9690-8openalex-snapshot
Strong-branching inequalities for convex mixed integer nonlinear programs
inferred← citeshttps://doi.org/10.1007/s12532-017-0118-1openalex-snapshot
Lift-and-project cuts for convex mixed integer nonlinear programs
inferred← citeshttps://doi.org/10.1016/j.ejor.2024.11.018openalex-snapshot
Last fifty years of integer linear programming: A focus on recent practical advances
inferred← citeshttps://doi.org/10.1016/s0166-218x(01)00266-9openalex-snapshot
Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem
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:1021320028145openalex-snapshot
Convex Normalizations in Lift-and-Project Methods for 0–1 Programming
inferred← citeshttps://doi.org/10.1023/a:1022938707934openalex-snapshot
Integer Programming Applied to Intensity-Modulated Radiation Therapy Treatment Planning
inferred← citeshttps://doi.org/10.1287/ijoc.1030.0027openalex-snapshot
Generating Cutting Planes for Mixed Integer Programming Problems in a Parallel Computing Environment
inferred← citeshttps://doi.org/10.1287/opre.2021.2126openalex-snapshot
A Repeated Route-then-Schedule Approach to Coordinated Vehicle Platooning: Algorithms, Valid Inequalities and Computation
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.