On the public citation graph
Nonlinear Discrete Optimization
0 signed · 171 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.1006/jsco.1993.1051openalex-snapshot
Efficient Computation of Zero-dimensional Gröbner Bases by Change of Ordering
inferredcites →https://doi.org/10.1007/3-540-60313-1_164openalex-snapshot
0/1-Integer programming: Optimization and Augmentation are equivalent
inferredcites →https://doi.org/10.1007/978-0-387-74759-0_415openalex-snapshot
Multi-index Transportation Problems
inferredcites →https://doi.org/10.1007/978-3-540-68279-0_3openalex-snapshot
Integral Boundary Points of Convex Polyhedra
inferredcites →https://doi.org/10.1007/978-3-642-97881-4openalex-snapshot
Geometric Algorithms and Combinatorial Optimization
inferredcites →https://doi.org/10.1007/bf01442864openalex-snapshot
Ueber die Auflösung linearer Gleichungen mit reellen Coefficienten
inferredcites →https://doi.org/10.1007/bf01580606openalex-snapshot
Signature classes of transportation polytopes
inferredcites →https://doi.org/10.1007/bf01681344openalex-snapshot
On the foundations of linear and integer linear programming I
inferredcites →https://doi.org/10.1007/bf01737559openalex-snapshot
A class of games possessing pure-strategy Nash equilibria
inferredcites →https://doi.org/10.1007/bf01844844openalex-snapshot
All 0–1 polytopes are traveling salesman polytopes
inferredcites →https://doi.org/10.1007/bf02591692openalex-snapshot
Transportation problems which can be solved by the use of hirsch-paths for the dual problems
inferredcites →https://doi.org/10.1007/s00454-004-1138-yopenalex-snapshot
Convex Combinatorial Optimization
inferredcites →https://doi.org/10.1007/s00454-008-9050-5openalex-snapshot
Generating All Vertices of a Polyhedron Is Hard
inferredcites →https://doi.org/10.1007/s10107-002-0322-1openalex-snapshot
Decomposition of test sets in stochastic integer programming
inferredcites →https://doi.org/10.1007/s10107-006-0086-0openalex-snapshot
Valid inequalities for mixed integer linear programs
inferredcites →https://doi.org/10.1007/s101070100233openalex-snapshot
A polynomial case of unconstrained zero-one quadratic optimization
inferredcites →https://doi.org/10.1007/s10208-005-0174-1openalex-snapshot
Finiteness Theorems in Stochastic Integer Programming
inferredcites →https://doi.org/10.1007/springerreference_57547openalex-snapshot
Approximation Algorithms
inferredcites →https://doi.org/10.1016/0012-365x(73)90167-2openalex-snapshot
Edmonds polytopes and a hierarchy of combinatorial problems
inferredcites →https://doi.org/10.1016/0041-5553(80)90061-0openalex-snapshot
Polynomial algorithms in linear programming
inferredcites →https://doi.org/10.1016/0095-8956(86)90064-xopenalex-snapshot
An integer analogue of Carathéodory's theorem
inferredcites →https://doi.org/10.1016/0166-218x(86)90069-7openalex-snapshot
Conditions for the existence of solutions of the three-dimensional planar transportation problem
inferredcites →https://doi.org/10.1016/j.disopt.2006.06.006openalex-snapshot
N -fold integer programming
inferredcites →https://doi.org/10.1016/j.disopt.2007.11.002openalex-snapshot
Nonlinear bipartite matching
inferredcites →https://doi.org/10.1016/j.jcta.2009.03.010openalex-snapshot
Graphs of transportation polytopes
inferredcites →https://doi.org/10.1016/j.jpaa.2008.11.033openalex-snapshot
Convex integer maximization via Graver bases
inferredcites →https://doi.org/10.1016/j.jsc.2003.08.007openalex-snapshot
From the zonotope construction to the Minkowski addition of convex polytopes
inferredcites →https://doi.org/10.1016/j.jspi.2007.03.022openalex-snapshot
Three centuries of categorical data analysis: Log-linear models and maximum likelihood estimation
inferredcites →https://doi.org/10.1016/j.orl.2003.11.007openalex-snapshot
Optimality criterion for a class of nonlinear integer programs
inferredcites →https://doi.org/10.1016/s0097-3165(03)00092-xopenalex-snapshot
Higher Lawrence configurations
inferredcites →https://doi.org/10.1016/s0167-5060(05)80009-3openalex-snapshot
Discrete Convex Analysis
inferredcites →https://doi.org/10.1016/s0167-5060(05)x8001-3openalex-snapshot
Submodular Functions and Optimization
inferredcites →https://doi.org/10.1016/s0196-8858(02)00509-2openalex-snapshot
The Hilbert zonotope and a polynomial time algorithm for universal Gröbner bases
inferredcites →https://doi.org/10.1016/s0378-3758(02)00392-0openalex-snapshot
On properties of multi-dimensional statistical tables
inferredcites →https://doi.org/10.1016/s0927-0507(03)10004-7openalex-snapshot
Stochastic Integer Programming
inferredcites →https://doi.org/10.1016/s0927-0507(05)12008-8openalex-snapshot
Semidefinite Programming and Integer Programming
inferredcites →https://doi.org/10.1017/s0013091500011925openalex-snapshot
The number of partitions of a set of N points in k dimensions induced by hyperplanes
inferredcites →https://doi.org/10.1023/a:1022417803474openalex-snapshot
An adaptive algorithm for vector partitioning
inferredcites →https://doi.org/10.1090/memo/0154openalex-snapshot
Facing up to arrangements: face-count formulas for partitions of space by hyperplanes
inferredcites →https://doi.org/10.1090/s0002-9939-00-05816-0openalex-snapshot
Antichains of monomial ideals are finite
inferredcites →https://doi.org/10.1111/1467-842x.00278openalex-snapshot
Minimal Basis for a Connected Markov Chain over 3 × 3 ×K Contingency Tables with Fixed Two‐Dimensional Marginals
inferredcites →https://doi.org/10.1137/0222031openalex-snapshot
On the Zone Theorem for Hyperplane Arrangements
inferredcites →https://doi.org/10.1137/0406019openalex-snapshot
Minkowski Addition of Polytopes: Computational Complexity and Applications to Gröbner Bases
inferredcites →https://doi.org/10.1137/070696465openalex-snapshot
Nonlinear Matroid Optimization and Experimental Design
inferredcites →https://doi.org/10.1137/0801013openalex-snapshot
Cones of Matrices and Set-Functions and 0–1 Optimization
inferredcites →https://doi.org/10.1137/080718103openalex-snapshot
Approximate Nonlinear Optimization over Weighted Independence Systems
inferredcites →https://doi.org/10.1137/1.9781611970791openalex-snapshot
Interior-Point Polynomial Algorithms in Convex Programming
inferredcites →https://doi.org/10.1137/s0097539702403803openalex-snapshot
The Complexity of Three-Way Statistical Tables
inferredcites →https://doi.org/10.1137/s0097539790191010openalex-snapshot
Three-dimensional Statistical Data Security Problems
inferredcites →https://doi.org/10.1137/s0895480102408559openalex-snapshot
Convex Matroid Optimization
inferredcites →https://doi.org/10.1137/s1052623497344002openalex-snapshot
A Polynomial Time Algorithm for Shaped Partition Problems
inferredcites →https://doi.org/10.1145/109648.109659openalex-snapshot
A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
inferredcites →https://doi.org/10.1145/210118.210137openalex-snapshot
A class of logic problems solvable by linear programming
inferredcites →https://doi.org/10.1145/28395.383347openalex-snapshot
Matching is as easy as matrix inversion
inferredcites →https://doi.org/10.1145/321694.321699openalex-snapshot
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
inferredcites →https://doi.org/10.1145/322217.322225openalex-snapshot
Fast Probabilistic Algorithms for Verification of Polynomial Identities
inferredcites →https://doi.org/10.1145/331524.331526openalex-snapshot
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
inferredcites →https://doi.org/10.1145/96559.96597openalex-snapshot
Convex separable optimization is not much harder than linear optimization
inferredcites →https://doi.org/10.1214/aos/1035844985openalex-snapshot
Clear two-factor interactions and minimum aberration
inferredcites →https://doi.org/10.1287/moor.1090.0427openalex-snapshot
Accuracy Certificates for Computational Problems with Convex Structure
inferredcites →https://doi.org/10.1287/moor.14.2.362openalex-snapshot
Maximizing Classes of Two-Parameter Objectives Over Matroids
inferredcites →https://doi.org/10.1287/moor.26.3.583.10587openalex-snapshot
The Vector Partition Problem for Convex Objective Functions
inferredcites →https://doi.org/10.1287/moor.8.4.538openalex-snapshot
Integer Programming with a Fixed Number of Variables
inferredcites →https://doi.org/10.1515/crll.1999.045openalex-snapshot
A counterexample to an integer analogue of Carathéodory's theorem
inferredcites →https://doi.org/10.2307/253980openalex-snapshot
Theory of Linear and Integer Programming
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
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-3-030-16194-1_7openalex-snapshot
On Block-Structured Integer Programming and Its Applications
inferred← citeshttps://doi.org/10.1007/978-3-030-17953-3_15openalex-snapshot
Integer Programming and Incidence Treedepth
inferred← citeshttps://doi.org/10.1007/978-3-030-92702-8_14openalex-snapshot
Improved Analysis of Online Balanced Clustering
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-93112-3_22openalex-snapshot
(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs
inferred← citeshttps://doi.org/10.1007/978-3-319-78434-2_5openalex-snapshot
Small Primitive Zonotopes
inferred← citeshttps://doi.org/10.1007/bf01069163openalex-snapshot
Polyhedral aspects of discrete optimization
inferred← citeshttps://doi.org/10.1007/bf01078060openalex-snapshot
Locally stochastic algorithms of discrete optimization (experiments and computational experience)
inferred← citeshttps://doi.org/10.1007/s10013-021-00523-6openalex-snapshot
The Complexity of Vector Partition
inferred← citeshttps://doi.org/10.1007/s10107-010-0358-6openalex-snapshot
Parametric nonlinear discrete optimization over well-described sets and matroid intersections
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-014-0792-yopenalex-snapshot
A framework of discrete DC programming by discrete convex analysis
inferred← citeshttps://doi.org/10.1007/s10107-018-1272-6openalex-snapshot
Algorithmic and modeling insights via volumetric comparison of polyhedral relaxations
inferred← citeshttps://doi.org/10.1007/s10107-019-01402-2openalex-snapshot
Combinatorial n-fold integer programming and applications
inferred← citeshttps://doi.org/10.1007/s10107-021-01694-3openalex-snapshot
Empowering the configuration-IP: new PTAS results for scheduling with setup times
inferred← citeshttps://doi.org/10.1007/s10107-022-01862-zopenalex-snapshot
Complexity of optimizing over the integers
inferred← citeshttps://doi.org/10.1007/s10107-022-01882-9openalex-snapshot
High-multiplicity N-fold IP via configuration LP
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/s10463-012-0367-8openalex-snapshot
Graver basis for an undirected graph and its application to testing the beta model of random graphs
inferred← citeshttps://doi.org/10.1007/s10878-015-9985-4openalex-snapshot
On nonlinear multi-covering 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/s10951-017-0550-0openalex-snapshot
Scheduling meets n-fold integer programming
inferred← citeshttps://doi.org/10.1016/j.artint.2017.12.006openalex-snapshot
The Complexity Landscape of Decompositional Parameters for ILP
inferred← citeshttps://doi.org/10.1016/j.artint.2021.103561openalex-snapshot
The complexity landscape of decompositional parameters for ILP: Programs with few global variables and constraints
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.2019.12.016openalex-snapshot
Optimization over degree sequences of graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2020.11.004openalex-snapshot
Ameso optimization: A relaxation of discrete midpoint convexity
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.disopt.2014.07.003openalex-snapshot
Huge multiway table problems
inferred← citeshttps://doi.org/10.1016/j.disopt.2016.06.001openalex-snapshot
Efficient solutions for weight-balanced partitioning problems
inferred← citeshttps://doi.org/10.1016/j.disopt.2019.100566openalex-snapshot
Circuit walks in integral polyhedra
inferred← citeshttps://doi.org/10.1016/j.disopt.2020.100596openalex-snapshot
Integer programming in parameterized complexity: Five miniatures
inferred← citeshttps://doi.org/10.1016/j.disopt.2021.100629openalex-snapshot
Approximate separable multichoice optimization over monotone systems
inferred← citeshttps://doi.org/10.1016/j.disopt.2024.100862openalex-snapshot
Circuit and Graver walks and linear and integer programming
inferred← citeshttps://doi.org/10.1016/j.jcss.2016.07.004openalex-snapshot
Huge tables and multicommodity flows are fixed-parameter tractable via unimodular integer Carathéodory
inferred← citeshttps://doi.org/10.1016/j.jcss.2018.06.002openalex-snapshot
Parameterized shifted combinatorial optimization
inferred← citeshttps://doi.org/10.1016/j.jpaa.2019.106249openalex-snapshot
Unboundedness of Markov complexity of monomial curves in An for n ≥ 4
inferred← citeshttps://doi.org/10.1016/j.laa.2014.01.007openalex-snapshot
Convex integer optimization by constantly many linear counterparts
inferred← citeshttps://doi.org/10.1016/j.orl.2016.05.013openalex-snapshot
Shifted matroid optimization
inferred← citeshttps://doi.org/10.1016/j.orl.2020.10.010openalex-snapshot
On degree sequence optimization
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.1021/acs.jpca.0c05941openalex-snapshot
Heuristic Global Optimization in Chemical Compound Space
inferred← citeshttps://doi.org/10.1088/1742-6596/1096/1/012160openalex-snapshot
Optimizing the selection of information security remedies in terms of a Markov security model
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/allerton.2013.6736708openalex-snapshot
Index coding problem with side information repositories
inferred← citeshttps://doi.org/10.1109/itw.2012.6404727openalex-snapshot
On the hardness of entropy minimization and related problems
inferred← citeshttps://doi.org/10.1109/mcsi55933.2022.00032openalex-snapshot
Finding an Optimal Proximity Bound in a Very Special Scenario
inferred← citeshttps://doi.org/10.1109/tit.2022.3215496openalex-snapshot
A Precise Bare Simulation Approach to the Minimization of Some Distances. I. Foundations
inferred← citeshttps://doi.org/10.1109/tr.2019.2909279openalex-snapshot
Reliability-Aware Offloading and Allocation in Multilevel Edge Computing System
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/151002915openalex-snapshot
On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds--Karp to Bland and Beyond
inferred← citeshttps://doi.org/10.1137/21m139935xopenalex-snapshot
Enumerating Integer Points in Polytopes with Bounded Subdeterminants
inferred← citeshttps://doi.org/10.1137/22m1489988openalex-snapshot
Minimizing a Low-Dimensional Convex Function Over a High-Dimensional Cube
inferred← citeshttps://doi.org/10.1142/s0129167x20500561openalex-snapshot
The slope conjecture for Montesinos knots
inferred← citeshttps://doi.org/10.1145/3328526.3329649openalex-snapshot
High-Multiplicity Fair Allocation
inferred← citeshttps://doi.org/10.1145/3330137openalex-snapshot
Evaluating and Tuning n -fold Integer Programming
inferred← citeshttps://doi.org/10.1145/3396855openalex-snapshot
Voting and Bribing in Single-Exponential Time
inferred← citeshttps://doi.org/10.1287/moor.2023.0162openalex-snapshot
Sparse Integer Programming Is Fixed-Parameter Tractable
inferred← citeshttps://doi.org/10.1365/s13291-012-0055-xopenalex-snapshot
Foundations of Discrete Optimization: In Transition from Linear to Non-linear Models and Methods
inferred← citeshttps://doi.org/10.15480/882.14153openalex-snapshot
Voting and Bribing in Single-Exponential Time
inferred← citeshttps://doi.org/10.15480/882.4138openalex-snapshot
Multitype Integer Monoid Optimization and Applications
inferred← citeshttps://doi.org/10.1609/aaai.v30i1.10078openalex-snapshot
The Complexity Landscape of Decompositional Parameters for ILP
inferred← citeshttps://doi.org/10.16953/deusosbil.535425openalex-snapshot
A REVIEW ON OPTIMIZATION LITERATURE RELATED TO OPERATIONS RESEARCH FIELD
inferred← citeshttps://doi.org/10.24963/ijcai.2017/85openalex-snapshot
Solving Integer Linear Programs with a Small Number of Global Variables and Constraints
inferred← citeshttps://doi.org/10.29007/wdd7openalex-snapshot
On the Complexity of Convex and Reverse Convex Prequadratic Constraints
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.4230/lipics.icalp.2018.85openalex-snapshot
A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs
inferred← citeshttps://doi.org/10.4230/lipics.itcs.2019.44openalex-snapshot
Empowering the Configuration-IP $-$ New PTAS Results for Scheduling with Setups Times
inferred← citeshttps://doi.org/10.4230/lipics.sea.2018.10openalex-snapshot
Evaluating and Tuning n-fold Integer Programming
inferred← citeshttps://doi.org/10.48550/arxiv.1101.3267openalex-snapshot
N-fold integer programming in cubic time
inferred← citeshttps://doi.org/10.48550/arxiv.1208.5639openalex-snapshot
Convex Integer Optimization by Constantly Many Linear Counterparts
inferred← citeshttps://doi.org/10.48550/arxiv.1307.2672openalex-snapshot
Index Coding Problem with Side Information Repositories
inferred← citeshttps://doi.org/10.48550/arxiv.1405.1189openalex-snapshot
The Huge Multiway Table Problem
inferred← citeshttps://doi.org/10.48550/arxiv.1503.06877openalex-snapshot
Efficient solutions for weight-balanced partitioning problems
inferred← citeshttps://doi.org/10.48550/arxiv.1511.00310openalex-snapshot
Parameterized Integer Quadratic Programming: Variables and Coefficients
inferred← citeshttps://doi.org/10.48550/arxiv.1706.02075openalex-snapshot
Approximate Shifted Combinatorial Optimization
inferred← citeshttps://doi.org/10.48550/arxiv.1808.08477openalex-snapshot
Discrete Decreasing Minimization, Part II: Views from Discrete Convex Analysis
inferred← citeshttps://doi.org/10.48550/arxiv.1809.09932openalex-snapshot
Unboundedness of Markov complexity of monomial curves in ${\mathbb A}^n$ for $n\geq 4$
inferred← citeshttps://doi.org/10.48550/arxiv.1902.01484openalex-snapshot
On the Complexity of Toric Ideals
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.2012.00079openalex-snapshot
Integer Programming and Incidence Treedepth
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.70675/5e791843z89ccz4801zb6a3z3c8e73fdb3b6openalex-snapshot
Programmation linéaire mixte robuste; Application au dimensionnement d'un système hybride de production d'électricité.
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.