On the public citation graph

{0, 1/2}-Chvátal-Gomory cuts

0 signed · 150 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.1002/9781118627372openalex-snapshot
Integer and Combinatorial Optimization
inferredcites →https://doi.org/10.1007/3-540-36478-1_3openalex-snapshot
Matching: A Well-Solved Class of Integer Linear Programs
inferredcites →https://doi.org/10.1007/bf01580870openalex-snapshot
Facets of the clique partitioning polytope
inferredcites →https://doi.org/10.1007/bf01581239openalex-snapshot
The partition problem
inferredcites →https://doi.org/10.1007/bf01582009openalex-snapshot
On the acyclic subgraph polytope
inferredcites →https://doi.org/10.1007/bf01582010openalex-snapshot
Facets of the linear ordering polytope
inferredcites →https://doi.org/10.1007/bf02579262openalex-snapshot
Matrices with the edmonds—Johnson property
inferredcites →https://doi.org/10.1007/bf02579273openalex-snapshot
The ellipsoid method and its consequences in combinatorial optimization
inferredcites →https://doi.org/10.1016/0095-8956(80)90075-1openalex-snapshot
Decomposition of regular matroids
inferredcites →https://doi.org/10.1016/0167-6377(81)90020-1openalex-snapshot
Weakly bipartite graphs and the Max-cut problem
inferredcites →https://doi.org/10.1057/jors.1987.94openalex-snapshot
Theory of Linear and Integer Programming
inferredcites →https://doi.org/10.1057/jors.1991.208openalex-snapshot
Discrete Location Theory
inferredcites →https://doi.org/10.1090/s0002-9939-1965-0180568-2openalex-snapshot
Characterization of Totally Unimodular Matrices
inferredcites →https://doi.org/10.1137/0402038openalex-snapshot
The Asymmetric Assignment Problem and Some New Facets of the Traveling Salesman Polytope on a Directed Graph
inferredcites →https://doi.org/10.1287/moor.17.4.981openalex-snapshot
Clique-Web Facets for Multicut Polytopes
inferredcites →https://doi.org/10.1287/moor.7.1.67openalex-snapshot
Odd Minimum Cut-Sets and b -Matchings
inferredcites →https://doi.org/10.1287/opre.32.6.1195openalex-snapshot
A Cutting Plane Algorithm for the Linear Ordering Problem
inferredcites →https://doi.org/10.2307/253980openalex-snapshot
Theory of Linear and Integer Programming
inferredcites →https://doi.org/10.2307/2583737openalex-snapshot
Integer and Combinatorial Optimization
inferredcites →https://doi.org/10.6028/jres.069b.013openalex-snapshot
Maximum matching and a polyhedron with 0,1-vertices

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.eorms0361openalex-snapshot
Gomory Cuts
inferred← citeshttps://doi.org/10.1002/9780470400531.eorms0505openalex-snapshot
Mathematical Programming Approaches to the Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1002/net.10004openalex-snapshot
The clique partitioning problem: Facets and patching facets
inferred← citeshttps://doi.org/10.1002/net.20122openalex-snapshot
On extended formulations for the precedence constrained asymmetric traveling salesman problem
inferred← citeshttps://doi.org/10.1002/net.20347openalex-snapshot
Recent results on Arc Routing Problems: An annotated bibliography
inferred← citeshttps://doi.org/10.1002/net.21576openalex-snapshot
Sorting common operations to minimize the number of tardy jobs
inferred← citeshttps://doi.org/10.1007/3-540-45535-3_26openalex-snapshot
Fences Are Futile: On Relaxations for the Linear Ordering Problem
inferred← citeshttps://doi.org/10.1007/3-540-47867-1_8openalex-snapshot
Polynomial-Time Separation of Simple Comb Inequalities
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/978-2-287-99037-3_12openalex-snapshot
b-couplages et T-joints
inferred← citeshttps://doi.org/10.1007/978-3-030-73879-2_28openalex-snapshot
Face Dimensions of General-Purpose Cutting Planes for Mixed-Integer Linear Programs
inferred← citeshttps://doi.org/10.1007/978-3-031-06901-7_14openalex-snapshot
Simple Odd $$\beta $$-Cycle Inequalities for Binary Polynomial Optimization
inferred← citeshttps://doi.org/10.1007/978-3-031-85181-0_2openalex-snapshot
A State-of-the-Art Cutting Plane Algorithm for Clique Partitioning
inferred← citeshttps://doi.org/10.1007/978-3-319-11008-0_1openalex-snapshot
Getting Started
inferred← citeshttps://doi.org/10.1007/978-3-319-11008-0_10openalex-snapshot
Semidefinite Bounds
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-11008-0_9openalex-snapshot
Enumeration
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-319-93031-2_16openalex-snapshot
Chasing First Queens by Integer Programming
inferred← citeshttps://doi.org/10.1007/978-3-540-25960-2_14openalex-snapshot
Combinatorial Benders’ Cuts
inferred← citeshttps://doi.org/10.1007/978-3-540-25960-2_15openalex-snapshot
A Faster Exact Separation Algorithm for Blossom Inequalities
inferred← citeshttps://doi.org/10.1007/978-3-540-68279-0_16openalex-snapshot
Mixed Integer Programming Computation
inferred← citeshttps://doi.org/10.1007/978-3-540-76796-1_1openalex-snapshot
On the Location and p-Median Polytopes
inferred← citeshttps://doi.org/10.1007/978-3-540-93980-1_1openalex-snapshot
Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-13036-6_25openalex-snapshot
The Chvátal-Gomory Closure of an Ellipsoid Is a Polyhedron
inferred← citeshttps://doi.org/10.1007/978-3-642-25401-7_12openalex-snapshot
b-Matchings und T-Joins
inferred← citeshttps://doi.org/10.1007/978-3-662-21708-5_12openalex-snapshot
b-Matchings and T-Joins
inferred← citeshttps://doi.org/10.1007/978-3-662-21711-5_12openalex-snapshot
b-Matchings and T-Joins
inferred← citeshttps://doi.org/10.1007/978-3-662-56039-6_12openalex-snapshot
b-Matchings and T-Joins
inferred← citeshttps://doi.org/10.1007/978-3-662-57691-5_12openalex-snapshot
b-Matchings und T-Joins
inferred← citeshttps://doi.org/10.1007/978-88-470-1523-4_12openalex-snapshot
b-Matching e T- Join
inferred← citeshttps://doi.org/10.1007/bf02592097openalex-snapshot
On the partial order polytope of a digraph
inferred← citeshttps://doi.org/10.1007/s00186-012-0400-yopenalex-snapshot
The opportunistic replacement problem: theoretical analyses and numerical tests
inferred← citeshttps://doi.org/10.1007/s00373-007-0721-4openalex-snapshot
Vašek Chvátal: A Very Short Introduction
inferred← citeshttps://doi.org/10.1007/s00453-008-9218-7openalex-snapshot
Algorithms to Separate $\{0,\frac{1}{2}\}$ -Chvátal-Gomory Cuts
inferred← citeshttps://doi.org/10.1007/s00453-012-9701-zopenalex-snapshot
Multicommodity Flow in Trees: Packing via Covering and Iterated Relaxation
inferred← citeshttps://doi.org/10.1007/s00453-020-00765-9openalex-snapshot
On the Tree Augmentation Problem
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-0402-xopenalex-snapshot
Binary clutter inequalities for integer programs
inferred← citeshttps://doi.org/10.1007/s10107-010-0399-xopenalex-snapshot
New results on the Windy Postman Problem
inferred← citeshttps://doi.org/10.1007/s10107-016-0991-9openalex-snapshot
Single-commodity robust network design with finite and Hose demand sets
inferred← citeshttps://doi.org/10.1007/s10107-018-1302-4openalex-snapshot
Theoretical challenges towards cutting-plane selection
inferred← citeshttps://doi.org/10.1007/s10107-018-1317-xopenalex-snapshot
On the Rational Polytopes with Chvátal Rank 1
inferred← citeshttps://doi.org/10.1007/s10107-019-01379-yopenalex-snapshot
Lattice closures of polyhedra
inferred← citeshttps://doi.org/10.1007/s10107-019-01430-yopenalex-snapshot
Facets from gadgets
inferred← citeshttps://doi.org/10.1007/s10107-020-01547-5openalex-snapshot
The confined primal integral: a measure to benchmark heuristic MINLP solvers against global MINLP solvers
inferred← citeshttps://doi.org/10.1007/s10107-023-01992-yopenalex-snapshot
Simple odd β -cycle inequalities for binary polynomial optimization
inferred← citeshttps://doi.org/10.1007/s10107980022aopenalex-snapshot
Models and algorithms for the 2-dimensional cell suppression problem in statistical disclosure control
inferred← citeshttps://doi.org/10.1007/s10288-003-0012-8openalex-snapshot
Primal separation algorithms
inferred← citeshttps://doi.org/10.1007/s10589-017-9967-9openalex-snapshot
A two-level graph partitioning problem arising in mobile wireless communications
inferred← citeshttps://doi.org/10.1007/s10898-016-0450-4openalex-snapshot
Three enhancements for optimization-based bound tightening
inferred← citeshttps://doi.org/10.1007/s10898-022-01157-9openalex-snapshot
Tight compact extended relaxations for nonconvex quadratic programming problems with box constraints
inferred← citeshttps://doi.org/10.1007/s10898-022-01252-xopenalex-snapshot
Lifting for the integer knapsack cover polyhedron
inferred← citeshttps://doi.org/10.1007/s11750-009-0096-1openalex-snapshot
Applying mod-k-cuts for solving linear ordering problems
inferred← citeshttps://doi.org/10.1007/s12532-013-0052-9openalex-snapshot
Local cuts for mixed-integer programming
inferred← citeshttps://doi.org/10.1007/s12532-016-0111-0openalex-snapshot
Thinning out Steiner trees: a node-based model for uniform edge costs
inferred← citeshttps://doi.org/10.1007/s12532-018-0133-xopenalex-snapshot
Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods
inferred← citeshttps://doi.org/10.1007/s13675-013-0012-1openalex-snapshot
Separating valid odd-cycle and odd-set inequalities for the multiple depot vehicle scheduling problem
inferred← citeshttps://doi.org/10.1016/j.cor.2016.11.019openalex-snapshot
An improved integer linear programming formulation for the closest 0-1 string problem
inferred← citeshttps://doi.org/10.1016/j.cor.2023.106467openalex-snapshot
A unified exact approach for a broad class of vehicle routing problems with simultaneous pickup and delivery
inferred← citeshttps://doi.org/10.1016/j.cor.2024.106580openalex-snapshot
Improving the scheduling of railway maintenance projects by minimizing passenger delays subject to event requests of railway operators
inferred← citeshttps://doi.org/10.1016/j.dam.2020.03.049openalex-snapshot
On matroid parity and matching polytopes
inferred← citeshttps://doi.org/10.1016/j.dam.2020.12.016openalex-snapshot
Chvátal–Gomory cuts for the Steiner tree problem
inferred← citeshttps://doi.org/10.1016/j.disopt.2004.12.002openalex-snapshot
Chvatal–Gomory–tier cuts for general integer programs
inferred← citeshttps://doi.org/10.1016/j.disopt.2005.06.004openalex-snapshot
On cycles and the stable multi-set polytope
inferred← citeshttps://doi.org/10.1016/j.disopt.2006.10.002openalex-snapshot
Metric inequalities and the Network Loading Problem
inferred← citeshttps://doi.org/10.1016/j.disopt.2008.10.004openalex-snapshot
Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results
inferred← citeshttps://doi.org/10.1016/j.disopt.2014.07.002openalex-snapshot
A new separation algorithm for the Boolean quadric and cut polytopes
inferred← citeshttps://doi.org/10.1016/j.disopt.2015.07.006openalex-snapshot
On the p -median polytope and the directed odd cycle inequalities: Triangle-free oriented graphs
inferred← citeshttps://doi.org/10.1016/j.disopt.2015.10.003openalex-snapshot
An integer programming approach to optimal basic block instruction scheduling for single-issue processors
inferred← citeshttps://doi.org/10.1016/j.disopt.2017.08.001openalex-snapshot
Projection results for the k -partition problem
inferred← citeshttps://doi.org/10.1016/j.disopt.2022.100757openalex-snapshot
A polyhedral study of lifted multicuts
inferred← citeshttps://doi.org/10.1016/j.ejor.2017.11.043openalex-snapshot
A dynamic reformulation heuristic for Generalized Interdiction Problems
inferred← citeshttps://doi.org/10.1016/j.ejor.2019.06.031openalex-snapshot
A Branch&Cut approach to recharging and refueling infrastructure planning
inferred← citeshttps://doi.org/10.1016/j.ejor.2023.02.017openalex-snapshot
Integer programming models for round robin tournaments
inferred← citeshttps://doi.org/10.1016/j.ejor.2023.03.022openalex-snapshot
Extended formulations for perfect domination problems and their algorithmic implications
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/j.ejor.2025.05.017openalex-snapshot
Presolving and cutting planes for the generalized maximal covering location problem
inferred← citeshttps://doi.org/10.1016/j.endm.2009.11.016openalex-snapshot
The Chvátal closure of generalized stable sets in bidirected graphs
inferred← citeshttps://doi.org/10.1016/j.endm.2010.05.019openalex-snapshot
On the p-median polytope of fork-free graphs
inferred← citeshttps://doi.org/10.1016/j.orl.2004.12.001openalex-snapshot
A fast algorithm for minimum weight odd circuits and cuts in planar graphs
inferred← citeshttps://doi.org/10.1016/j.orl.2006.04.003openalex-snapshot
Optimization with binet matrices
inferred← citeshttps://doi.org/10.1016/j.orl.2009.06.006openalex-snapshot
Stable sets, corner polyhedra and the Chvátal closure
inferred← citeshttps://doi.org/10.1016/j.orl.2011.07.003openalex-snapshot
On the membership problem for the -closure
inferred← citeshttps://doi.org/10.1016/j.orl.2014.05.004openalex-snapshot
A short proof for the polyhedrality of the Chvátal–Gomory closure of a compact convex set
inferred← citeshttps://doi.org/10.1016/j.orl.2014.08.005openalex-snapshot
On a connection between facility location and perfect graphs
inferred← citeshttps://doi.org/10.1016/j.orl.2018.01.013openalex-snapshot
When the Gomory–Chvátal closure coincides with the integer hull
inferred← citeshttps://doi.org/10.1016/j.orl.2018.04.006openalex-snapshot
On the complete set packing and set partitioning polytopes: Properties and rank 1 facets
inferred← citeshttps://doi.org/10.1016/j.orl.2018.05.006openalex-snapshot
A note on the 2-circulant inequalities for the max-cut problem
inferred← citeshttps://doi.org/10.1016/j.orl.2021.06.011openalex-snapshot
A separation algorithm for the simple plant location problem
inferred← citeshttps://doi.org/10.1016/j.orl.2021.11.009openalex-snapshot
On the complexity of recognizing integrality and total dual integrality of the {0,1/2}-closure
inferred← citeshttps://doi.org/10.1016/j.orl.2022.01.005openalex-snapshot
Generalised 2-circulant inequalities for the max-cut problem
inferred← citeshttps://doi.org/10.1016/j.orl.2022.10.002openalex-snapshot
On small-depth tree augmentations
inferred← citeshttps://doi.org/10.1016/j.orl.2024.107156openalex-snapshot
Primal separation and approximation for the {0,1/2}-closure
inferred← citeshttps://doi.org/10.1016/j.orl.2025.107242openalex-snapshot
New facets of the clique partitioning polytope
inferred← citeshttps://doi.org/10.1016/j.trb.2015.06.001openalex-snapshot
The recoverable robust facility location problem
inferred← citeshttps://doi.org/10.1016/s0012-365x(03)00095-5openalex-snapshot
Rational and integral k-regular matrices
inferred← citeshttps://doi.org/10.1016/s0166-218x(00)00307-3openalex-snapshot
Discrete relaxations of combinatorial programs
inferred← citeshttps://doi.org/10.1016/s0166-218x(01)00348-1openalex-snapshot
Cutting planes in integer and mixed integer programming
inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00050-5openalex-snapshot
Separating lifted odd-hole inequalities to solve the index selection problem
inferred← citeshttps://doi.org/10.1016/s0167-6377(02)00111-6openalex-snapshot
Totally tight Chvátal–Gomory cuts
inferred← citeshttps://doi.org/10.1023/a:1011493126498openalex-snapshot
On Disjunctive Cuts for Combinatorial Optimization
inferred← citeshttps://doi.org/10.1103/physreve.106.035305openalex-snapshot
Cutting-plane algorithms and solution whitening for the vertex-cover problem
inferred← citeshttps://doi.org/10.1109/tase.2018.2835298openalex-snapshot
A Scalable Solution Methodology for Mixed-Integer Linear Programming Problems Arising in Automation
inferred← citeshttps://doi.org/10.1109/tbme.2018.2889915openalex-snapshot
Reliable Label-Efficient Learning for Biomedical Image Recognition
inferred← citeshttps://doi.org/10.1111/1467-9574.00104openalex-snapshot
Polyhedral techniques in combinatorial optimization II: applications and computations
inferred← citeshttps://doi.org/10.1111/j.1475-3995.2009.00696.xopenalex-snapshot
A survey on vertex coloring problems
inferred← citeshttps://doi.org/10.1137/060664793openalex-snapshot
Odd Minimum Cut Sets and b -Matchings Revisited
inferred← citeshttps://doi.org/10.1137/1.9781611975031.53openalex-snapshot
Approximating Weighted Tree Augmentation via Chvátal-Gomory Cuts
inferred← citeshttps://doi.org/10.1137/130926389openalex-snapshot
Iterated Chvátal--Gomory Cuts and the Geometry of Numbers
inferred← citeshttps://doi.org/10.1137/s0895480104440985openalex-snapshot
0, 1/2‐Cuts and the Linear Ordering Problem: Surfaces That Define Facets
inferred← citeshttps://doi.org/10.1145/2822890openalex-snapshot
Solving Linear Programs without Breaking Abstractions
inferred← citeshttps://doi.org/10.1287/ijoc.1040.0125openalex-snapshot
Maximally Violated Mod-p Cuts for the Capacitated Vehicle-Routing Problem
inferred← citeshttps://doi.org/10.1287/ijoc.1050.0162openalex-snapshot
Embedding {0, ½}-Cuts in a Branch-and-Cut Framework: A Computational Study
inferred← citeshttps://doi.org/10.1287/mnsc.43.11.1520openalex-snapshot
A Polyhedral Approach to the Asymmetric Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1287/moor.1060.0214openalex-snapshot
Polynomial-Time Separation of a Superclass of Simple Comb Inequalities
inferred← citeshttps://doi.org/10.1287/moor.25.3.443.12213openalex-snapshot
Separating a Superclass of Comb Inequalities in Planar Graphs
inferred← citeshttps://doi.org/10.1287/opre.1060.0286openalex-snapshot
Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
inferred← citeshttps://doi.org/10.1287/opre.2018.1763openalex-snapshot
Online Vehicle Routing: The Edge of Optimization in Large-Scale Applications
inferred← citeshttps://doi.org/10.1287/opre.49.3.363.11211openalex-snapshot
Aggregation and Mixed Integer Rounding to Solve MIPs
inferred← citeshttps://doi.org/10.14279/depositonce-3291openalex-snapshot
Capacitated Network Design - Multi-Commodity Flow Formulations, Cutting Planes, and Demand Uncertainty
inferred← citeshttps://doi.org/10.1590/s0103-17592012000100009openalex-snapshot
Uma nova abordagem branch and cut aplicada ao problema de planejamento da expansão de redes de transmissão de grande porte
inferred← citeshttps://doi.org/10.3390/systems13090745openalex-snapshot
Chvátal–Gomory Cuts Applied to the Nurse Rostering Problem
inferred← citeshttps://doi.org/10.4230/lipics.esa.2017.61openalex-snapshot
A $\frac{3}{2}$-Approximation Algorithm for Tree Augmentation via Chvátal-Gomory Cuts
inferred← citeshttps://doi.org/10.48550/arxiv.1306.1202openalex-snapshot
A note on QUBO instances defined on Chimera graphs
inferred← citeshttps://doi.org/10.70675/eb85af7cz8c3az4104z8bdcz85151a3ff110openalex-snapshot
Efficient solution approaches and uncertainty estimation for the project resource leveling problem
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.