On the public citation graph
On the foundations of linear and integer linear programming I
0 signed · 152 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/0021-8693(72)90123-8openalex-snapshot
Algebra structures for general designs
inferredcites →https://doi.org/10.1016/0097-3165(73)90037-xopenalex-snapshot
The module structure of integral designs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4765218openalex-extracted
Product Design in an Established Market: Efficient Algorithms under the EBA Model
inferred← citeshttps://doi.org/10.1002/9780470400531.eorms0677openalex-snapshot
Polynomial Time Primal Integer Programming via Graver Bases
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_213openalex-snapshot
Branch and price: Integer programming with column generation; Decomposition techniques for MILP: Lagrangian relaxation; Integer linear complementary problem; Integer programming; Integer programming: Branch and bound methods; Integer programming: Branch and cut algorithms; Integer programming:…
inferred← citeshttps://doi.org/10.1007/3-540-63397-9_21openalex-snapshot
Test sets of the knapsack problem and simultaneous diophantine approximation
inferred← citeshttps://doi.org/10.1007/3-540-63397-9_8openalex-snapshot
Decomposition of integer programs and of generating sets
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_285openalex-snapshot
Integer Programming: Algebraic Methods
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_94openalex-snapshot
Convex Discrete 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-4613-0303-9_8openalex-snapshot
Gröbner Bases in Integer Programming
inferred← citeshttps://doi.org/10.1007/978-1-4614-1927-3_20openalex-snapshot
Theory and Applications of n-Fold Integer Programming
inferred← citeshttps://doi.org/10.1007/978-1-4615-6103-3_9openalex-snapshot
Integer and Mixed-Integer Programming
inferred← citeshttps://doi.org/10.1007/978-2-287-99037-3_5openalex-snapshot
Programmation en nombres entiers
inferred← citeshttps://doi.org/10.1007/978-3-030-16194-1_7openalex-snapshot
On Block-Structured Integer Programming and Its Applications
inferred← citeshttps://doi.org/10.1007/978-3-030-45771-6_20openalex-snapshot
About the Complexity of Two-Stage Stochastic IPs
inferred← citeshttps://doi.org/10.1007/978-3-031-52113-3_6openalex-snapshot
New Support Size Bounds and Proximity Bounds for Integer Linear Programming
inferred← citeshttps://doi.org/10.1007/978-3-031-61433-0_7openalex-snapshot
Hilbert Composition of Multilabelled Events
inferred← citeshttps://doi.org/10.1007/978-3-031-93112-3_22openalex-snapshot
(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs
inferred← citeshttps://doi.org/10.1007/978-3-032-02867-9_13openalex-snapshot
Process Area Extraction by Multilevel Resource Detection for Object-Centric Process Mining
inferred← citeshttps://doi.org/10.1007/978-3-032-27879-1_3openalex-snapshot
Old and New Perspectives on Petri Nets Flows
inferred← citeshttps://doi.org/10.1007/978-3-540-68279-0_15openalex-snapshot
Nonlinear Integer Programming
inferred← citeshttps://doi.org/10.1007/978-3-540-72792-7_29openalex-snapshot
Characterizations of Total Dual Integrality
inferred← citeshttps://doi.org/10.1007/978-3-642-13036-6_17openalex-snapshot
A Polynomial-Time Algorithm for Optimizing over N-Fold 4-Block Decomposable Integer Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-95322-4_1openalex-snapshot
The Theorem of Minkowski for Polyhedral Monoids and Aggregated Linear Diophantine Systems
inferred← citeshttps://doi.org/10.1007/978-3-662-04331-8_30openalex-snapshot
Decomposition Methods for Two-Stage Stochastic Integer Programs
inferred← citeshttps://doi.org/10.1007/978-3-662-04851-1_8openalex-snapshot
Algorithms for the Toric Hilbert Scheme
inferred← citeshttps://doi.org/10.1007/bf01582230openalex-snapshot
Sensitivity theorems in integer linear programming
inferred← citeshttps://doi.org/10.1007/bf01583794openalex-snapshot
The value function of an integer program
inferred← citeshttps://doi.org/10.1007/bf02614622openalex-snapshot
Variation of cost functions in integer programming
inferred← citeshttps://doi.org/10.1007/s00026-009-0029-6openalex-snapshot
The Graver Complexity of Integer Programming
inferred← citeshttps://doi.org/10.1007/s00026-015-0287-4openalex-snapshot
Markov Bases and Generalized Lawrence Liftings
inferred← citeshttps://doi.org/10.1007/s00026-015-0297-2openalex-snapshot
Lower Bounds on the Graver Complexity of M-Fold Matrices
inferred← citeshttps://doi.org/10.1007/s00186-007-0184-7openalex-snapshot
Vector and matrix apportionment problems and separable convex integer optimization
inferred← citeshttps://doi.org/10.1007/s10107-002-0315-0openalex-snapshot
Integral decomposition of polyhedra and some applications in mixed integer programming
inferred← citeshttps://doi.org/10.1007/s10107-002-0322-1openalex-snapshot
Decomposition of test sets in stochastic integer programming
inferred← citeshttps://doi.org/10.1007/s10107-003-0385-7openalex-snapshot
On the positive sum property and the computation of Graver test sets
inferred← citeshttps://doi.org/10.1007/s10107-006-0711-yopenalex-snapshot
Two-stage integer programs with stochastic right-hand sides: a superadditive dual approach
inferred← citeshttps://doi.org/10.1007/s10107-009-0276-7openalex-snapshot
A polynomial oracle-time algorithm for convex integer minimization
inferred← citeshttps://doi.org/10.1007/s10107-010-0383-5openalex-snapshot
Alternatives for testing total dual integrality
inferred← citeshttps://doi.org/10.1007/s10107-011-0447-1openalex-snapshot
Cone superadditivity of discrete convex functions
inferred← citeshttps://doi.org/10.1007/s10107-011-0490-yopenalex-snapshot
n-Fold integer programming in cubic time
inferred← citeshttps://doi.org/10.1007/s10107-012-0605-0openalex-snapshot
The quadratic Graver cone, quadratic integer minimization, and extensions
inferred← citeshttps://doi.org/10.1007/s10107-013-0638-zopenalex-snapshot
Graver basis and proximity techniques for block-structured separable convex integer minimization problems
inferred← citeshttps://doi.org/10.1007/s10107-015-0956-4openalex-snapshot
Quadratic diameter bounds for dual network flow polyhedra
inferred← citeshttps://doi.org/10.1007/s10107-023-02046-zopenalex-snapshot
FPT algorithms for a special block-structured integer program with applications in scheduling
inferred← citeshttps://doi.org/10.1007/s10107-026-02341-5openalex-snapshot
(Near)-Optimal algorithms for sparse separable convex integer programs
inferred← citeshttps://doi.org/10.1007/s10208-005-0174-1openalex-snapshot
Finiteness Theorems in Stochastic Integer Programming
inferred← citeshttps://doi.org/10.1007/s10288-026-00628-zopenalex-snapshot
Mathematical programming approaches for social welfare maximization
inferred← citeshttps://doi.org/10.1007/s10586-024-04643-9openalex-snapshot
A hybrid approach of ALNS with alternative initialization and acceptance mechanisms for capacitated vehicle routing problems
inferred← citeshttps://doi.org/10.1007/s10878-025-01313-3openalex-snapshot
On combinatorial network flows algorithms and circuit augmentation for pseudoflows
inferred← citeshttps://doi.org/10.1007/s11590-010-0231-9openalex-snapshot
N-fold integer programming and nonlinear multi-transshipment
inferred← citeshttps://doi.org/10.1007/s11786-012-0120-yopenalex-snapshot
Decomposition of Modular Codes for Computing Test Sets and Graver Basis
inferred← citeshttps://doi.org/10.1007/s12567-024-00573-9openalex-snapshot
A model-based approach for the preliminary design of the SAR upstream element for the Italian IRIDE EO constellation based on users’ demand
inferred← citeshttps://doi.org/10.1016/0012-365x(77)90028-0openalex-snapshot
The value function of a mixed integer program: I
inferred← citeshttps://doi.org/10.1016/0166-218x(84)90022-2openalex-snapshot
Constructive characterizations of the value-function of a mixed-integer program I
inferred← citeshttps://doi.org/10.1016/0166-218x(85)90045-9openalex-snapshot
Constructive characterizations of the value function of a mixed-integer program II
inferred← citeshttps://doi.org/10.1016/j.cor.2025.107204openalex-snapshot
Augmentation search for integer programming over a polyhedron
inferred← citeshttps://doi.org/10.1016/j.dam.2019.07.025openalex-snapshot
A polyhedral model for enumeration and optimization over the set of circuits
inferred← citeshttps://doi.org/10.1016/j.dam.2025.02.009openalex-snapshot
On the hardness of short and sign-compatible circuit walks
inferred← citeshttps://doi.org/10.1016/j.disc.2018.09.021openalex-snapshot
The fiber dimension of a graph
inferred← citeshttps://doi.org/10.1016/j.disopt.2006.06.006openalex-snapshot
N -fold integer programming
inferred← citeshttps://doi.org/10.1016/j.disopt.2017.08.004openalex-snapshot
Solving MIPs via scaling-based augmentation
inferred← citeshttps://doi.org/10.1016/j.disopt.2019.100566openalex-snapshot
Circuit walks in integral polyhedra
inferred← citeshttps://doi.org/10.1016/j.disopt.2024.100825openalex-snapshot
Circuits in extended formulations
inferred← citeshttps://doi.org/10.1016/j.disopt.2025.100910openalex-snapshot
On the circuit diameter conjecture for counterexamples to the Hirsch conjecture
inferred← citeshttps://doi.org/10.1016/j.ejor.2014.01.059openalex-snapshot
When is rounding allowed in integer nonlinear optimization?
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2018.05.016openalex-snapshot
Bouquet algebra of toric ideals
inferred← citeshttps://doi.org/10.1016/j.jenvman.2022.115037openalex-snapshot
AIS explorer: Prioritization for watercraft inspections-A decision-support tool for aquatic invasive species management
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.jpaa.2008.11.044openalex-snapshot
On the Gröbner complexity of matrices
inferred← citeshttps://doi.org/10.1016/j.jsc.2009.04.006openalex-snapshot
Computing generating sets of lattice ideals and Markov bases of lattices
inferred← citeshttps://doi.org/10.1016/j.orl.2003.11.007openalex-snapshot
Optimality criterion for a class of nonlinear integer programs
inferred← citeshttps://doi.org/10.1016/j.orl.2008.02.002openalex-snapshot
On test sets for nonlinear integer maximization
inferred← citeshttps://doi.org/10.1016/j.orl.2020.04.004openalex-snapshot
An implementation of steepest-descent augmentation for linear programs
inferred← citeshttps://doi.org/10.1016/j.orl.2021.02.003openalex-snapshot
A note on the approximability of deepest-descent circuit steps
inferred← citeshttps://doi.org/10.1016/j.suscom.2018.10.003openalex-snapshot
Optimizing energy consumption for a performance-aware cloud data center in the public sector
inferred← citeshttps://doi.org/10.1016/j.swevo.2024.101836openalex-snapshot
Quantum particle swarm optimization with chaotic encoding schemes for flexible job-shop scheduling problem
inferred← citeshttps://doi.org/10.1016/s0022-4049(99)00009-2openalex-snapshot
Standard pairs and group relaxations in integer programming
inferred← citeshttps://doi.org/10.1016/s0166-218x(01)00337-7openalex-snapshot
Non-standard approaches to integer programming
inferred← citeshttps://doi.org/10.1057/9781137024411_10openalex-snapshot
Matrices with Identical Sets of Neighbors
inferred← citeshttps://doi.org/10.1063/1.5006890openalex-snapshot
Coarse-grained entanglement classification through orthogonal arrays
inferred← citeshttps://doi.org/10.1090/bull/1653openalex-snapshot
The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
inferred← citeshttps://doi.org/10.1090/conm/625/12491openalex-snapshot
Combinatorics and geometry of transportation polytopes: An update
inferred← citeshttps://doi.org/10.1090/pspum/111/02040openalex-snapshot
The nonlinear algebra view of discrete mathematics
inferred← citeshttps://doi.org/10.1101/845719openalex-snapshot
Quantum and Quantum-inspired Methods for de novo Discovery of Altered Cancer Pathways
inferred← citeshttps://doi.org/10.1109/access.2025.3561083openalex-snapshot
SDN-Based Edge Computing in Vehicular Communication Networks: A Survey of Existing Approaches
inferred← citeshttps://doi.org/10.1109/jlt.2024.3519778openalex-snapshot
Improved ILP Models and Heuristics for Solving Routing and Resource Allocation Problems in Optical Networks
inferred← citeshttps://doi.org/10.1109/tcc.2024.3502464openalex-snapshot
HyperPart: A Hypergraph-Based Abstraction for Deduplicated Storage Systems
inferred← citeshttps://doi.org/10.1109/wsc60868.2023.10407242openalex-snapshot
Hybrid Approaches For Handling Mobile Crane Location Problems In Construction Sites
inferred← citeshttps://doi.org/10.1112/plms/pdn006openalex-snapshot
Minimal vanishing sums of roots of unity with large coefficients
inferred← citeshttps://doi.org/10.1121/10.0032456openalex-snapshot
Strategic deployment in the deep: Principled underwater sensor placement optimization with three-dimensional acoustic map
inferred← citeshttps://doi.org/10.1137/040616474openalex-snapshot
Representation of Sets of Lattice Points
inferred← citeshttps://doi.org/10.1137/1.9781611975031.178openalex-snapshot
Covering a tree with rooted subtrees – parameterized and approximation algorithms
inferred← citeshttps://doi.org/10.1137/1.9781611976465.101openalex-snapshot
Block-Structured Integer and Linear Programming in Strongly Polynomial and Near Linear Time
inferred← citeshttps://doi.org/10.1137/140976868openalex-snapshot
On the Circuit Diameter of Dual Transportation Polyhedra
inferred← citeshttps://doi.org/10.1137/151002915openalex-snapshot
On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds--Karp to Bland and Beyond
inferred← citeshttps://doi.org/10.1137/20m1330658openalex-snapshot
Constructing Clustering Transformations
inferred← citeshttps://doi.org/10.1137/21m1404417openalex-snapshot
Geometry of the Minimal Solutions of a Linear Diophantine Equation
inferred← citeshttps://doi.org/10.1137/23m1561312openalex-snapshot
New Bounds for the Integer Carathéodory Rank
inferred← citeshttps://doi.org/10.1145/3503229.3547059openalex-snapshot
Towards an integrated approach for managing the variability and evolution of both software and hardware components
inferred← citeshttps://doi.org/10.1145/3664646.3665086openalex-snapshot
Conference Program Scheduling using Genetic Algorithms
inferred← citeshttps://doi.org/10.1186/s13321-022-00621-8openalex-snapshot
What makes a reaction network “chemical”?
inferred← citeshttps://doi.org/10.1287/ijoc.2024.0574openalex-snapshot
A Quantum-Inspired Bilevel Optimization Algorithm for the First Responder Network Design Problem
inferred← citeshttps://doi.org/10.1287/moor.20.4.864openalex-snapshot
A Geometric Buchberger Algorithm for Integer Programming
inferred← citeshttps://doi.org/10.1287/moor.2023.0162openalex-snapshot
Sparse Integer Programming Is Fixed-Parameter Tractable
inferred← citeshttps://doi.org/10.1287/moor.23.4.863openalex-snapshot
Matrices with Identical Sets of Neighbors
inferred← citeshttps://doi.org/10.1287/moor.3.2.145openalex-snapshot
Some Basis Theorems for Integral Monoids
inferred← citeshttps://doi.org/10.2140/obs.2019.2.275openalex-snapshot
Higher-dimensional sieving for the number field sieve algorithms
inferred← citeshttps://doi.org/10.3233/978-1-60750-718-5-183openalex-snapshot
Convex Discrete Optimization
inferred← citeshttps://doi.org/10.33395/sinkron.v8i3.12591openalex-snapshot
Integer Linear Programming Model for Multicast Routing to Minimize Link Cost at Wavelengths
inferred← citeshttps://doi.org/10.3389/fcomp.2023.1286657openalex-snapshot
Pneumonia detection by binary classification: classical, quantum, and hybrid approaches for support vector machine (SVM)
inferred← citeshttps://doi.org/10.3389/fcomp.2023.1286860openalex-snapshot
Quantum annealing research at CMU: algorithms, hardware, applications
inferred← citeshttps://doi.org/10.4171/rmi/347openalex-snapshot
Minimal Resolutions of Lattice Ideals and Integer Linear Programming
inferred← citeshttps://doi.org/10.4230/lipics.esa.2020.33openalex-snapshot
New Bounds on Augmenting Steps of Block-Structured Integer Programs
inferred← citeshttps://doi.org/10.46298/dmtcs.10506openalex-snapshot
Several Roman domination graph invariants on Kneser graphs
inferred← citeshttps://doi.org/10.48550/arxiv.0903.4577openalex-snapshot
Nash-equilibria and N-fold integer programming
inferred← citeshttps://doi.org/10.48550/arxiv.0906.5106openalex-snapshot
Multicommodity Flow in Polynomial Time
inferred← citeshttps://doi.org/10.48550/arxiv.1101.3267openalex-snapshot
N-fold integer programming in cubic time
inferred← citeshttps://doi.org/10.48550/arxiv.1408.4184openalex-snapshot
Quadratic diameter bounds for dual network flow polyhedra
inferred← citeshttps://doi.org/10.48550/arxiv.1902.08218openalex-snapshot
Covering a tree with rooted subtrees
inferred← citeshttps://doi.org/10.48550/arxiv.1904.01361openalex-snapshot
An Algorithmic Theory of Integer Programming
inferred← citeshttps://doi.org/10.48550/arxiv.1907.10930openalex-snapshot
GAMA: A Novel Algorithm for Non-Convex Integer Programs
inferred← citeshttps://doi.org/10.48550/arxiv.2012.11382openalex-snapshot
Quantum Integer Programming (QuIP) 47-779: Lecture Notes
inferred← citeshttps://doi.org/10.48550/arxiv.2107.01373openalex-snapshot
FPT Algorithms for a Special Block-structured Integer Program with Applications in Scheduling
inferred← citeshttps://doi.org/10.48550/arxiv.math/0309154openalex-snapshot
Test Sets for Integer Programs with Z-Convex Objective
inferred← citeshttps://doi.org/10.48550/arxiv.math/0410334openalex-snapshot
Exploiting Symmetries in the Computation of Graver Bases
inferred← citeshttps://doi.org/10.48550/arxiv.math/0508359openalex-snapshot
Computing generating sets of lattice ideals
inferred← citeshttps://doi.org/10.48550/arxiv.math/0605242openalex-snapshot
N-Fold Integer Programming
inferred← citeshttps://doi.org/10.48550/arxiv.math/0612615openalex-snapshot
Truncated Markov bases and Gröbner bases for Integer Programming
inferred← citeshttps://doi.org/10.53846/goediss-4169openalex-snapshot
A level set approach to integer nonlinear optimization
inferred← citeshttps://doi.org/10.5815/ijitcs.2021.01.03openalex-snapshot
Evaluation of TSP for Emergency Routing
inferred← citeshttps://doi.org/10.6084/m9.figshare.21162858openalex-snapshot
Additional file 1 of What makes a reaction network “chemical”?
inferred← citeshttps://doi.org/10.65109/qmiy3805openalex-snapshot
High-Multiplicity Fair Allocation Made More Practical
inferred← citeshttps://doi.org/10.7240/jeps.1752589openalex-snapshot
Kuantum Yaklaşık Optimizasyon Algoritması İçin Hamilton İşlemcisi İnşası Yöntemlerinin Karşılaştırmalı Analizi
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.