On the public citation graph
A lift-and-project cutting plane algorithm for mixed 0–1 programs
0 signed · 645 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.1007/bf01585701openalex-snapshot
An additive bounding procedure for the asymmetric travelling salesman problem
inferredcites →https://doi.org/10.1007/bf01587096openalex-snapshot
Sequential convexification in reverse convex and disjunctive programming
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/0167-6377(87)90002-2openalex-snapshot
Optimization of a 532-city symmetric traveling salesman problem by branch and cut
inferredcites →https://doi.org/10.1016/0167-6377(90)90031-yopenalex-snapshot
Optimization of a 532-city symmetric traveling salesman problem by branch and cut
inferredcites →https://doi.org/10.1016/0377-2217(80)90106-xopenalex-snapshot
Strengthening cuts for mixed integer programs
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.1080/05695557408974946openalex-snapshot
A Capital Budgeting Heuristic Algorithm Using Exchange Operations
inferredcites →https://doi.org/10.1137/0318018openalex-snapshot
A Cutting-Plane Game for Facial Disjunctive Programs
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.1159/000273299openalex-snapshot
Der Saccus endolymphaticus bei Entzündungsprozessen
inferredcites →https://doi.org/10.1287/mnsc.13.9.736openalex-snapshot
Computational Experience with Variants of the Balas Algorithm Applied to the Selection of R&D Projects
inferredcites →https://doi.org/10.1287/mnsc.26.1.86openalex-snapshot
Pivot and Complement–A Heuristic for 0-1 Programming
inferredcites →https://doi.org/10.1287/mnsc.26.7.736openalex-snapshot
Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem
inferredcites →https://doi.org/10.1287/opre.19.1.19openalex-snapshot
Intersection Cuts—A New Type of Cutting Planes for Integer Programming
inferredcites →https://doi.org/10.1287/opre.31.5.803openalex-snapshot
Solving Large-Scale Zero-One Linear Programming Problems
inferredcites →https://doi.org/10.1287/opre.35.1.45openalex-snapshot
Solving Mixed Integer Programming Problems Using Automatic Reformulation
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/0470025018.ch11openalex-snapshot
Advances in Logic‐Based Optimization Approaches to Process Integration and Supply Chain Management
inferred← citeshttps://doi.org/10.1002/1097-024x(200009)30:11<1325::aid-spe342>3.0.co;2-topenalex-snapshot
The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization
inferred← citeshttps://doi.org/10.1002/14356007.b01_01.pub2openalex-snapshot
Mathematics in Chemical Engineering
inferred← citeshttps://doi.org/10.1002/9780470400531.eorms0232openalex-snapshot
Stochastic Mixed‐Integer Programming Algorithms: Beyond Benders' Decomposition
inferred← citeshttps://doi.org/10.1002/9780470400531.eorms0262openalex-snapshot
Disjunctive Programming
inferred← citeshttps://doi.org/10.1002/9780470400531.eorms0463openalex-snapshot
Lift‐and‐Project Inequalities
inferred← citeshttps://doi.org/10.1002/9780470400531.eorms0537openalex-snapshot
Disjunctive Inequalities: Applications And Extensions
inferred← citeshttps://doi.org/10.1002/9780470400531.eorms0712openalex-snapshot
Reformulation‐Linearization Technique for MIPs
inferred← citeshttps://doi.org/10.1002/9780470400531.eorms0937openalex-snapshot
Use of L agrange Interpolating Polynomials in the RLT
inferred← citeshttps://doi.org/10.1002/9780470400531.eorms1084openalex-snapshot
Pure Cutting‐Plane Algorithms and their Convergence
inferred← citeshttps://doi.org/10.1002/9781118445112.stat02265.pub2openalex-snapshot
Integer Programming
inferred← citeshttps://doi.org/10.1002/9781118600283.ch3openalex-snapshot
A Comparison of Some Valid Inequality Generation Methods for General 0–1 Problems
inferred← citeshttps://doi.org/10.1002/9781119005384.ch3openalex-snapshot
A Comparison of Some Valid Inequality Generation Methods for General 0–1 Problems
inferred← citeshttps://doi.org/10.1002/9781394205646.ch6openalex-snapshot
Optimization Models and Algorithms for Design and Planning of Sustainable Processes and Energy Systems
inferred← citeshttps://doi.org/10.1002/aic.11616openalex-snapshot
An improved branch‐and‐cut algorithm for mixed‐integer nonlinear systems optimization problem
inferred← citeshttps://doi.org/10.1002/nav.22134openalex-snapshot
Quantifying the benefits of customized vaccination strategies: A network‐based optimization approach
inferred← citeshttps://doi.org/10.1002/net.20137openalex-snapshot
Acceleration of cutting‐plane and column generation algorithms: Applications to network design
inferred← citeshttps://doi.org/10.1002/net.22114openalex-snapshot
Distributionally risk‐receptive and risk‐averse network interdiction problems with general ambiguity set
inferred← citeshttps://doi.org/10.1007/0-306-47663-0_9openalex-snapshot
Solving Hard Mixed-Integer Programs for Electricity Generation
inferred← citeshttps://doi.org/10.1007/0-306-48109-x_6openalex-snapshot
A Summary and Illustration of Disjunctive Decomposition with Set Convexification
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_212openalex-snapshot
Airline optimization; Alignment problem; Branch and price: Integer programming with column generation; Decomposition techniques for MILP: Lagrangian relaxation; Graph coloring; Integer linear complementary problem; Integer programming; Integer programming: Algebraic methods; Integer programming:…
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_215openalex-snapshot
Branch and price: Integer programming with column generation; Decomposition techniques for MILP: Lagrangian relaxation; Integer linear complementary problem; Integer programming; Integer programming: Algebraic methods; Integer programming: Branch and bound methods; Integer programming: Cutting…
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_426openalex-snapshot
Reformulation-Linearization Methods for Global Optimization
inferred← citeshttps://doi.org/10.1007/0-387-22444-0_6openalex-snapshot
Semidefinite Programs and Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/0-387-25592-3_5openalex-snapshot
Interior Point and Semidefinite Approaches in Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/0-387-32942-0_13openalex-snapshot
Computational Molecular Biology
inferred← citeshttps://doi.org/10.1007/0-387-32942-0_8openalex-snapshot
Strategic and Tactical Planning Models for Supply Chain: An Application of Stochastic Mixed Integer Programming
inferred← citeshttps://doi.org/10.1007/10720084_1openalex-snapshot
Combining Logic and Optimization in Cutting Plane Theory
inferred← citeshttps://doi.org/10.1007/11841036_62openalex-snapshot
An MINLP Solution Method for a Water Network Problem
inferred← citeshttps://doi.org/10.1007/3-540-36478-1_12openalex-snapshot
An Augment-and-Branch-and-Cut Framework for Mixed 0-1 Programming
inferred← citeshttps://doi.org/10.1007/3-540-36478-1_15openalex-snapshot
A Simplex-Based Algorithm for 0-1 Mixed Integer Programming
inferred← citeshttps://doi.org/10.1007/3-540-45535-3_20openalex-snapshot
Cutting Planes for Mixed 0-1 Semidefinite Programs
inferred← citeshttps://doi.org/10.1007/3-540-45535-3_27openalex-snapshot
Generating Cuts from Multiple-Term Disjunctions
inferred← citeshttps://doi.org/10.1007/3-540-45535-3_6openalex-snapshot
On the Rank of Mixed 0,1 Polyhedra
inferred← citeshttps://doi.org/10.1007/3-540-45586-8_1openalex-snapshot
General Mixed Integer Programming: Computational Issues for Branch-and-Cut Algorithms
inferred← citeshttps://doi.org/10.1007/3-540-45586-8_2openalex-snapshot
Projection and Lifting in Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/3-540-47867-1_11openalex-snapshot
An Exponential Lower Bound on the Length of Some Classes of Branch-and-Cut Proofs
inferred← citeshttps://doi.org/10.1007/3-540-47867-1_12openalex-snapshot
Lifted Inequalities for 0-1 Mixed Integer Programming: Basic Theory and Algorithms
inferred← citeshttps://doi.org/10.1007/3-540-48777-8_17openalex-snapshot
On the Chvátal Rank of Certain Inequalities
inferred← citeshttps://doi.org/10.1007/3-540-48777-8_7openalex-snapshot
On the Separation of Maximally Violated mod-k Cuts
inferred← citeshttps://doi.org/10.1007/3-540-59155-9_2openalex-snapshot
Solving pseudo-Boolean constraints
inferred← citeshttps://doi.org/10.1007/3-540-59408-6_43openalex-snapshot
Computational study of a family of mixed-integer quadratic programming problems
inferred← citeshttps://doi.org/10.1007/3-540-59408-6_46openalex-snapshot
Combining semidefinite and polyhedral relaxations for integer programs
inferred← citeshttps://doi.org/10.1007/3-540-59408-6_71openalex-snapshot
Combining and strengthening Gomory cuts
inferred← citeshttps://doi.org/10.1007/3-540-61310-2_14openalex-snapshot
Quadratic knapsack relaxations using cutting planes and semidefinite programming
inferred← citeshttps://doi.org/10.1007/3-540-69346-7_19openalex-snapshot
The Intersection of Knapsack Polyhedra and Extensions
inferred← citeshttps://doi.org/10.1007/3-540-69346-7_21openalex-snapshot
Solving Integer and Disjunctive Programs by Lift and Project
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_134openalex-snapshot
Disjunctive Programming
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_287openalex-snapshot
Integer Programming: Branch and Cut Algorithms
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_393openalex-snapshot
Mixed-Integer Nonlinear Optimization: A Disjunctive Cutting Plane Approach
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_559openalex-snapshot
Reformulation-Linearization Technique for Global Optimization
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-1-4419-1153-7_129openalex-snapshot
Integer and Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4419-6810-4_3openalex-snapshot
The Persistence and Effectiveness of Large-Scale Mathematical Programming Strategies: Projection, Outer Linearization, and Inner Linearization
inferred← citeshttps://doi.org/10.1007/978-1-4419-7997-1_45openalex-snapshot
Reformulation–Linearization Techniques for Discrete Optimization Problems
inferred← citeshttps://doi.org/10.1007/978-1-4612-1960-6_5openalex-snapshot
Mixed-Integer Nonlinear Programming: A Survey of Algorithms and Applications
inferred← citeshttps://doi.org/10.1007/978-1-4613-0301-5_2openalex-snapshot
Branch and Cut Methods for Mixed Integer Linear Programming Problems
inferred← citeshttps://doi.org/10.1007/978-1-4613-0303-9_4openalex-snapshot
Interior Point Methods for Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4613-0303-9_7openalex-snapshot
Reformulation-Linearization Techniques for Discrete Optimization Problems
inferred← citeshttps://doi.org/10.1007/978-1-4613-0307-7_8openalex-snapshot
On the Linear Maxmin and Related Programming Problems
inferred← citeshttps://doi.org/10.1007/978-1-4613-3437-8_6openalex-snapshot
Dynamic Matrix Factorization Methods for Using Formulations Derived From Higher Order Lifting Techniques in the Solution of the Quadratic Assignment Problem
inferred← citeshttps://doi.org/10.1007/978-1-4613-3449-1_11openalex-snapshot
Interior Point Methods for Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4614-1927-3_1openalex-snapshot
Algorithms and Software for Convex Mixed Integer Nonlinear Programs
inferred← citeshttps://doi.org/10.1007/978-1-4614-1927-3_16openalex-snapshot
Computation with Polynomial Equations and Inequalities Arising in Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4614-1927-3_2openalex-snapshot
Subgradient Based Outer Approximation for Mixed Integer Second Order Cone Programming
inferred← citeshttps://doi.org/10.1007/978-1-4614-1927-3_5openalex-snapshot
Disjunctive Cuts for Nonconvex MINLP
inferred← citeshttps://doi.org/10.1007/978-1-4614-6624-6_45-1openalex-snapshot
Reformulation–Linearization Techniques for Mixed-Discrete Optimization Problems
inferred← citeshttps://doi.org/10.1007/978-1-4614-8987-0_4openalex-snapshot
Smoothing and Regularization for Mixed-Integer Second-Order Cone Programming with Applications in Portfolio Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4615-1049-9_1openalex-snapshot
Coin-Or: An Open-Source Library for Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4615-5087-7_1openalex-snapshot
Multicommodity Capacitated Network Design
inferred← citeshttps://doi.org/10.1007/978-1-4757-2807-1_3openalex-snapshot
Disjunctive Programming and Cooperating Solvers
inferred← citeshttps://doi.org/10.1007/978-1-4757-3145-3_28openalex-snapshot
Towards Implementations of Successive Convex Relaxation Methods for Nonconvex Quadratic Optimization Problems
inferred← citeshttps://doi.org/10.1007/978-1-4757-3279-5_15openalex-snapshot
Successive Convex Relaxation Approach to Bilevel Quadratic Optimization Problems
inferred← citeshttps://doi.org/10.1007/978-3-030-00148-3_12openalex-snapshot
Disjunctive Cuts from the V -Polyhedral Representation
inferred← citeshttps://doi.org/10.1007/978-3-030-00148-3_6openalex-snapshot
Lift-and-Project Cuts for Mixed 0-1 Programs
inferred← citeshttps://doi.org/10.1007/978-3-030-00148-3_7openalex-snapshot
Nonlinear Higher-Dimensional Representations
inferred← citeshttps://doi.org/10.1007/978-3-030-17953-3_29openalex-snapshot
Intersection Cuts for Factorable MINLP
inferred← citeshttps://doi.org/10.1007/978-3-030-19212-9_15openalex-snapshot
Consistency for 0–1 Programming
inferred← citeshttps://doi.org/10.1007/978-3-030-21803-4_34openalex-snapshot
Parallel DC Cutting Plane Algorithms for Mixed Binary Linear Program
inferred← citeshttps://doi.org/10.1007/978-3-030-54621-2_134-1openalex-snapshot
Disjunctive Programming
inferred← citeshttps://doi.org/10.1007/978-3-030-54621-2_287-1openalex-snapshot
Integer Programming: Branch-and-Cut Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-030-59223-3_1openalex-snapshot
Recent Advances in Computational Models for the Discrete and Continuous Optimization of Industrial Process Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-73879-2_4openalex-snapshot
Sum-of-Squares Hierarchies for Binary Polynomial Optimization
inferred← citeshttps://doi.org/10.1007/978-3-031-06901-7_8openalex-snapshot
Sparse Multi-term Disjunctive Cuts for the Epigraph of a Function of Binary Variables
inferred← citeshttps://doi.org/10.1007/978-3-031-32726-1_20openalex-snapshot
Monoidal Strengthening of Simple $$\mathcal {V}$$-Polyhedral Disjunctive Cuts
inferred← citeshttps://doi.org/10.1007/978-3-031-93112-3_33openalex-snapshot
Implied Integrality in Mixed-Integer Optimization
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-07557-0_15openalex-snapshot
Cut Generation through Binarization
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/978-3-319-17689-5_1openalex-snapshot
A Conic Representation of the Convex Hull of Disjunctive Sets and Conic Cuts for Integer Second Order Cone Optimization
inferred← citeshttps://doi.org/10.1007/978-3-319-18842-3_2openalex-snapshot
Basic Properties of Linear Programs
inferred← citeshttps://doi.org/10.1007/978-3-319-18842-3_4openalex-snapshot
Duality and Complementarity
inferred← citeshttps://doi.org/10.1007/978-3-319-20086-6_8openalex-snapshot
On the Generation of Cutting Planes which Maximize the Bound Improvement
inferred← citeshttps://doi.org/10.1007/978-3-319-47898-2_17openalex-snapshot
Extended Formulations for Online Action Selection on Big Action Sets
inferred← citeshttps://doi.org/10.1007/978-3-319-58017-3_16openalex-snapshot
Global Optimal Solution to Quadratic Discrete Programming Problem with Inequality Constraints
inferred← citeshttps://doi.org/10.1007/978-3-319-66616-7_8openalex-snapshot
Exact Separation of k-Projection Polytope Constraints
inferred← citeshttps://doi.org/10.1007/978-3-540-25960-2_3openalex-snapshot
Valid Inequalities Based on Simple Mixed-Integer Sets
inferred← citeshttps://doi.org/10.1007/978-3-540-68279-0_11openalex-snapshot
Polyhedral Approaches to Mixed Integer Linear Programming
inferred← citeshttps://doi.org/10.1007/978-3-540-68279-0_18openalex-snapshot
Semidefinite Relaxations for Integer Programming
inferred← citeshttps://doi.org/10.1007/978-3-540-68891-4_1openalex-snapshot
Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables
inferred← citeshttps://doi.org/10.1007/978-3-540-68891-4_2openalex-snapshot
Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-72792-7_2openalex-snapshot
Cuts for Conic Mixed-Integer Programming
inferred← citeshttps://doi.org/10.1007/978-3-540-72792-7_8openalex-snapshot
New Variants of Lift-and-Project Cut Generation from the LP Tableau: Open Source Implementation and Testing
inferred← citeshttps://doi.org/10.1007/978-3-642-00142-0_79openalex-snapshot
Strengthening Gomory Mixed-Integer Cuts
inferred← citeshttps://doi.org/10.1007/978-3-642-13036-6_34openalex-snapshot
On the Rank of Cutting-Plane Proof Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-13193-6_23openalex-snapshot
Improving Cutting Plane Generation with 0-1 Inequalities by Bi-criteria Separation
inferred← citeshttps://doi.org/10.1007/978-3-642-15155-2_58openalex-snapshot
Breaking the Rectangle Bound Barrier against Formula Size Lower Bounds
inferred← citeshttps://doi.org/10.1007/978-3-642-17022-5_40openalex-snapshot
Proofs of Unsatisfiability Via Semidefinite Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-20807-2_12openalex-snapshot
Design and Verify: A New Scheme for Generating Cutting-Planes
inferred← citeshttps://doi.org/10.1007/978-3-642-20807-2_17openalex-snapshot
An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-20807-2_2openalex-snapshot
Complexity Analyses of Bienstock–Zuckerberg and Lasserre Relaxations on the Matching and Stable Set Polytopes
inferred← citeshttps://doi.org/10.1007/978-3-642-20807-2_24openalex-snapshot
Integrality Gaps of Linear and Semi-Definite Programming Relaxations for Knapsack
inferred← citeshttps://doi.org/10.1007/978-3-642-20807-2_27openalex-snapshot
Convexification Techniques for Linear Complementarity Constraints
inferred← citeshttps://doi.org/10.1007/978-3-642-20807-2_5openalex-snapshot
Lift-and-Project Cuts for Mixed Integer Convex Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-36694-9_30openalex-snapshot
0/1 Polytopes with Quadratic Chvátal Rank
inferred← citeshttps://doi.org/10.1007/978-3-642-36694-9_4openalex-snapshot
Intersection Cuts for Mixed Integer Conic Quadratic Sets
inferred← citeshttps://doi.org/10.1007/978-3-642-46955-8_13openalex-snapshot
Using strong cutting planes in constraint logic programming
inferred← citeshttps://doi.org/10.1007/978-3-642-58891-4_76openalex-snapshot
Branch & Cut Methods for Capacitated Lot Sizing
inferred← citeshttps://doi.org/10.1007/978-3-642-60972-5_21openalex-snapshot
Mixed-Integer Optimization Techniques for the Design and Scheduling of Batch Processes
inferred← citeshttps://doi.org/10.1007/978-94-015-9552-0openalex-snapshot
Model-Based Decision Support Methodology with Environmental Applications
inferred← citeshttps://doi.org/10.1007/978-981-287-892-2_2openalex-snapshot
Consensus with Utility Preferences
inferred← citeshttps://doi.org/10.1007/978-981-95-8337-9_50openalex-snapshot
Accelerating Transformer Fault Diagnosis Method Based on Data and Mechanism
inferred← citeshttps://doi.org/10.1007/bf00247210openalex-snapshot
The 0-1 bidimensional knapsack problem: Toward an efficient high-level primitive tool
inferred← citeshttps://doi.org/10.1007/bf01100205openalex-snapshot
A recipe for semidefinite relaxation for (0,1)-quadratic programming
inferred← citeshttps://doi.org/10.1007/bf02085635openalex-snapshot
Solving 0/1 integer programs with enumeration cutting planes
inferred← citeshttps://doi.org/10.1007/bf02568602openalex-snapshot
Combinatorial optimization and small polytopes
inferred← citeshttps://doi.org/10.1007/bf02592208openalex-snapshot
Computational study of a family of mixed-integer quadratic programming problems
inferred← citeshttps://doi.org/10.1007/bf02614309openalex-snapshot
A modified lift-and-project procedure
inferred← citeshttps://doi.org/10.1007/bf02614315openalex-snapshot
Semidefinite programming in combinatorial optimization
inferred← citeshttps://doi.org/10.1007/bf02614436openalex-snapshot
Connections between semidefinite relaxations of the max-cut and stable set problems
inferred← citeshttps://doi.org/10.1007/bf02698263openalex-snapshot
Mathematical programming approaches to the synthesis of chemical process systems
inferred← citeshttps://doi.org/10.1007/pl00011394openalex-snapshot
Discretization and localization in successive convex relaxation methods for nonconvex quadratic optimization
inferred← citeshttps://doi.org/10.1007/pl00011407openalex-snapshot
A disjunctive cutting plane procedure for general mixed-integer linear programs
inferred← citeshttps://doi.org/10.1007/s00186-013-0431-zopenalex-snapshot
Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem
inferred← citeshttps://doi.org/10.1007/s00186-020-00723-9openalex-snapshot
On the facet defining inequalities of the mixed-integer bilinear covering set
inferred← citeshttps://doi.org/10.1007/s001860200200openalex-snapshot
Primal cutting plane algorithms revisited
inferred← citeshttps://doi.org/10.1007/s10107-002-0317-yopenalex-snapshot
A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming
inferred← citeshttps://doi.org/10.1007/s10107-002-0320-3openalex-snapshot
On the separation of split cuts and related inequalities
inferred← citeshttps://doi.org/10.1007/s10107-003-0398-2openalex-snapshot
Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms
inferred← citeshttps://doi.org/10.1007/s10107-003-0405-7openalex-snapshot
An algorithm for mixed integer optimization
inferred← citeshttps://doi.org/10.1007/s10107-003-0406-6openalex-snapshot
Lift-and-project cuts and perfect graphs
inferred← citeshttps://doi.org/10.1007/s10107-003-0407-5openalex-snapshot
The stable set problem and the lift-and-project ranks of graphs
inferred← citeshttps://doi.org/10.1007/s10107-003-0445-zopenalex-snapshot
Stochastic programming with integer variables
inferred← citeshttps://doi.org/10.1007/s10107-003-0450-2openalex-snapshot
Strong formulations for mixed integer programs: valid inequalities and extended formulations
inferred← citeshttps://doi.org/10.1007/s10107-003-0495-2openalex-snapshot
An improved semidefinite programming relaxation for the satisfiability problem
inferred← citeshttps://doi.org/10.1007/s10107-003-0500-9openalex-snapshot
Lagrangian decomposition of block-separable mixed-integer all-quadratic programs
inferred← citeshttps://doi.org/10.1007/s10107-004-0561-4openalex-snapshot
Semidefinite representations for finite varieties
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-005-0578-3openalex-snapshot
Cuts for mixed 0-1 conic programming
inferred← citeshttps://doi.org/10.1007/s10107-005-0592-5openalex-snapshot
Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming
inferred← citeshttps://doi.org/10.1007/s10107-005-0594-3openalex-snapshot
Perspective cuts for a class of convex 0–1 mixed integer programs
inferred← citeshttps://doi.org/10.1007/s10107-005-0599-yopenalex-snapshot
Valid inequalities based on simple mixed-integer sets
inferred← citeshttps://doi.org/10.1007/s10107-005-0650-zopenalex-snapshot
Polyhedra related to integer-convex polynomial systems
inferred← citeshttps://doi.org/10.1007/s10107-005-0665-5openalex-snapshot
Mixed Integer Models for the Stationary Case of Gas Network Optimization
inferred← citeshttps://doi.org/10.1007/s10107-005-0670-8openalex-snapshot
A convex-analysis perspective on disjunctive cuts
inferred← citeshttps://doi.org/10.1007/s10107-005-0692-2openalex-snapshot
On the gap between the quadratic integer programming problem and its semidefinite relaxation
inferred← citeshttps://doi.org/10.1007/s10107-006-0049-5openalex-snapshot
Optimizing over the split closure
inferred← citeshttps://doi.org/10.1007/s10107-006-0051-yopenalex-snapshot
Projected Chvátal–Gomory cuts for mixed integer linear programs
inferred← citeshttps://doi.org/10.1007/s10107-006-0086-0openalex-snapshot
Valid inequalities for mixed integer linear programs
inferred← citeshttps://doi.org/10.1007/s10107-006-0724-6openalex-snapshot
On solving discrete two-stage stochastic programs having mixed-integer first- and second-stage variables
inferred← citeshttps://doi.org/10.1007/s10107-007-0100-1openalex-snapshot
Valid inequalities and restrictions for stochastic programming problems with first order stochastic dominance constraints
inferred← citeshttps://doi.org/10.1007/s10107-007-0140-6openalex-snapshot
The mixing-MIR set with divisible capacities
inferred← citeshttps://doi.org/10.1007/s10107-008-0239-4openalex-snapshot
Conic mixed-integer rounding cuts
inferred← citeshttps://doi.org/10.1007/s10107-008-0245-6openalex-snapshot
Computing deep facet-defining disjunctive cuts for mixed-integer programming
inferred← citeshttps://doi.org/10.1007/s10107-009-0281-xopenalex-snapshot
On the relative strength of split, triangle and quadrilateral cuts
inferred← citeshttps://doi.org/10.1007/s10107-009-0329-yopenalex-snapshot
A note on the split rank of intersection cuts
inferred← citeshttps://doi.org/10.1007/s10107-009-0332-3openalex-snapshot
Branching on general disjunctions
inferred← citeshttps://doi.org/10.1007/s10107-010-0340-3openalex-snapshot
Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
inferred← citeshttps://doi.org/10.1007/s10107-010-0360-zopenalex-snapshot
Perspective reformulations of mixed integer nonlinear programs with indicator variables
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/s10107-010-0374-6openalex-snapshot
Strong valid inequalities for orthogonal disjunctions and bilinear covering sets
inferred← citeshttps://doi.org/10.1007/s10107-010-0376-4openalex-snapshot
Mixed-integer sets from two rows of two adjacent simplex bases
inferred← citeshttps://doi.org/10.1007/s10107-010-0435-xopenalex-snapshot
Tightening simple mixed-integer sets with guaranteed bounds
inferred← citeshttps://doi.org/10.1007/s10107-011-0483-xopenalex-snapshot
Generalized intersection cuts and a new cut generating paradigm
inferred← citeshttps://doi.org/10.1007/s10107-012-0513-3openalex-snapshot
Strong lift-and-project cutting planes for the stable set problem
inferred← citeshttps://doi.org/10.1007/s10107-012-0564-5openalex-snapshot
The Steiner connectivity problem
inferred← citeshttps://doi.org/10.1007/s10107-012-0596-xopenalex-snapshot
Coordinated cutting plane generation via multi-objective separation
inferred← citeshttps://doi.org/10.1007/s10107-012-0615-yopenalex-snapshot
Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs
inferred← citeshttps://doi.org/10.1007/s10107-013-0645-0openalex-snapshot
Design and verify: a new scheme for generating cutting-planes
inferred← citeshttps://doi.org/10.1007/s10107-013-0650-3openalex-snapshot
Convex hull representation of the deterministic bipartite network interdiction problem
inferred← citeshttps://doi.org/10.1007/s10107-015-0870-9openalex-snapshot
A dynamic inequality generation scheme for polynomial programming
showing the first 200 of 624 · page through all 624
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.