On the public citation graph
Variation of cost functions in integer programming
0 signed · 114 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.1002/9781118032886.scardopenalex-snapshot
Wiley‐Interscience Series in Discrete Mathematics and Optimization
inferredcites →https://doi.org/10.1006/jctb.1993.1020openalex-snapshot
Duality and Minors of Secondary Polyhedra
inferredcites →https://doi.org/10.1007/3-540-54522-0_102openalex-snapshot
Buchberger algorithm and integer programming
inferredcites →https://doi.org/10.1007/3-540-59408-6_57openalex-snapshot
GRIN: An implementation of Gröbner bases for integer programming
inferredcites →https://doi.org/10.1007/978-0-8176-4771-1openalex-snapshot
Discriminants, Resultants, and Multidimensional Determinants
inferredcites →https://doi.org/10.1007/bf01580443openalex-snapshot
An alternate implementation of Goldfarb's minimization algorithm
inferredcites →https://doi.org/10.1007/bf01582230openalex-snapshot
Sensitivity theorems in integer linear programming
inferredcites →https://doi.org/10.1007/bf01583794openalex-snapshot
The value function of an integer program
inferredcites →https://doi.org/10.1007/bf01585566openalex-snapshot
An algebraic geometry algorithm for scheduling in presence of setups and correlated demands
inferredcites →https://doi.org/10.1007/bf01681344openalex-snapshot
On the foundations of linear and integer linear programming I
inferredcites →https://doi.org/10.1016/0001-8708(90)90077-zopenalex-snapshot
Constructions and complexity of secondary polytopes
inferredcites →https://doi.org/10.1016/b978-1-898563-21-1.50008-0openalex-snapshot
Mathematical Programming
inferredcites →https://doi.org/10.1016/s0747-7171(88)80042-7openalex-snapshot
The Gröbner fan of an ideal
inferredcites →https://doi.org/10.1016/s0747-7171(88)80043-9openalex-snapshot
Standard bases and geometric invariant theoryI. Initial ideals and state polytopes
inferredcites →https://doi.org/10.1017/cbo9780511565847.008openalex-snapshot
Gröbner Bases and Integer Programming
inferredcites →https://doi.org/10.1057/9781137024411_5openalex-snapshot
Neighborhood Systems for Production Sets with Indivisibilities
inferredcites →https://doi.org/10.1112/blms/21.6.621openalex-snapshot
THEORY OF LINEAR AND INTEGER PROGRAMMING (Wiley-Interscience Series in Discrete Mathematics and Optimization)
inferredcites →https://doi.org/10.1112/blms/28.6.667openalex-snapshot
AN INTRODUCTION TO GRÖBNER BASES (Graduate Studies in Mathematics 3)
inferredcites →https://doi.org/10.1137/0215024openalex-snapshot
Constructing Arrangements of Lines and Hyperplanes with Applications
inferredcites →https://doi.org/10.1214/aos/1030563990openalex-snapshot
Algebraic algorithms for sampling from conditional distributions
inferredcites →https://doi.org/10.1287/moor.17.3.608openalex-snapshot
Neighbors of the Origin for Four by Three Matrices
inferredcites →https://doi.org/10.1287/moor.20.4.864openalex-snapshot
A Geometric Buchberger Algorithm for Integer Programming
inferredcites →https://doi.org/10.2140/pjm.1969.28.465openalex-snapshot
Lifting projections of convex polyhedra
inferredcites →https://doi.org/10.2206/kyushumfs.46.217openalex-snapshot
ASYMPTOTIC ANALYSIS OF TORIC IDEALS
inferredcites →https://doi.org/10.2307/1911306openalex-snapshot
Neighborhood Systems for Production Sets with Indivisibilities
inferredcites →https://doi.org/10.2307/253980openalex-snapshot
Theory of Linear and Integer Programming
inferredcites →https://doi.org/10.2748/tmj/1178227496openalex-snapshot
Gröbner bases of toric varieties
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jsco.1999.0397openalex-snapshot
Primary Decomposition of Lattice Basis Ideals
inferred← citeshttps://doi.org/10.1007/3-540-59408-6_57openalex-snapshot
GRIN: An implementation of Gröbner bases for integer programming
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-4615-6103-3_9openalex-snapshot
Integer and Mixed-Integer Programming
inferred← citeshttps://doi.org/10.1007/978-1-4757-2807-1_4openalex-snapshot
An Annotated Bibliography for Post-Solution Analysis in Mixed Integer Programming and Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-3-031-06901-7_11openalex-snapshot
On Circuit Diameter Bounds via Circuit Imbalances
inferred← citeshttps://doi.org/10.1007/978-3-031-32726-1_13openalex-snapshot
Designing Optimization Problems with Diverse Solutions
inferred← citeshttps://doi.org/10.1007/978-3-319-95349-6_1openalex-snapshot
Polynomial Rings and Gröbner Bases
inferred← citeshttps://doi.org/10.1007/978-3-319-95349-6_3openalex-snapshot
Introduction to Binomial Ideals
inferred← citeshttps://doi.org/10.1007/978-3-319-95349-6_4openalex-snapshot
Convex Polytopes and Unimodular Triangulations
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-540-85221-6_15openalex-snapshot
The Structure of the Complex of Maximal Lattice Free Bodies for a Matrix of Size (n + 1) × n
inferred← citeshttps://doi.org/10.1007/978-3-662-03891-8_7openalex-snapshot
Gröbner Bases and Integer Programming
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/bf01293595openalex-snapshot
A combinatorial result on Gr�bner Fans with an application to universal Gr�bner bases
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/s002000050062openalex-snapshot
Truncated Gröbner Bases for Integer Programming
inferred← citeshttps://doi.org/10.1007/s00454-001-0062-7openalex-snapshot
Combinatorics of the Toric Hilbert Scheme
inferred← citeshttps://doi.org/10.1007/s00454-001-0087-yopenalex-snapshot
Toric Ideals and an Infinite Family of Normal (0, 1)-Polytopes without Unimodular Regular Triangulations
inferred← citeshttps://doi.org/10.1007/s00454-004-1138-yopenalex-snapshot
Convex Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/s00454-023-00563-4openalex-snapshot
Monotone Paths on Cross-Polytopes
inferred← citeshttps://doi.org/10.1007/s00493-007-2057-3openalex-snapshot
Computing the integer programming gap
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-010-0383-5openalex-snapshot
Alternatives for testing total dual integrality
inferred← citeshttps://doi.org/10.1007/s10107-020-01595-xopenalex-snapshot
Asymptotic behavior of integer programming and the stability of the Castelnuovo–Mumford regularity
inferred← citeshttps://doi.org/10.1007/s10107-024-02107-xopenalex-snapshot
On circuit diameter bounds via circuit imbalances
inferred← citeshttps://doi.org/10.1007/s10107-024-02126-8openalex-snapshot
Optimizing for strategy diversity in the design of video games
inferred← citeshttps://doi.org/10.1007/s10479-022-04698-0openalex-snapshot
Limit laws for empirical optimal solutions in random linear programs
inferred← citeshttps://doi.org/10.1007/s11047-009-9165-5openalex-snapshot
The combinatorics of modeling and analyzing biological systems
inferred← citeshttps://doi.org/10.1007/s11766-025-4809-5openalex-snapshot
Regular control surfaces of a toric patch and integer programming
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.disopt.2003.12.002openalex-snapshot
Generating functions and duality for integer programs
inferred← citeshttps://doi.org/10.1016/j.endm.2015.06.070openalex-snapshot
The Circuit Diameter of the Klee-Walkup Polyhedron
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.jsc.2025.102529openalex-snapshot
Integer programming with binary and bounded variables via Gröbner bases with applications to multiobjective integer programming
inferred← citeshttps://doi.org/10.1016/j.laa.2005.07.017openalex-snapshot
Permutohedra and minimal matrices
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.1016/s0196-8858(02)00030-1openalex-snapshot
The vertex ideal of a lattice
inferred← citeshttps://doi.org/10.1016/s0377-2217(01)00163-1openalex-snapshot
The multiparametric 0–1-integer linear programming problem: A unified approach
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)12003-9openalex-snapshot
The Structure of Group Relaxations
inferred← citeshttps://doi.org/10.1016/s1571-0653(05)80028-9openalex-snapshot
Test Sets for Vertex Cover Problems
inferred← citeshttps://doi.org/10.1023/b:jaco.0000030705.93448.ceopenalex-snapshot
Supernormal Vector Configurations
inferred← citeshttps://doi.org/10.1080/10586458.2000.10504409openalex-snapshot
Computing Gröbner Fans of Toric Ideals
inferred← citeshttps://doi.org/10.1080/10586458.2012.703886openalex-snapshot
Universal Gröbner Bases of Colored Partition Identities
inferred← citeshttps://doi.org/10.1090/psapm/061/2104733openalex-snapshot
Algebraic recipes for integer programming
inferred← citeshttps://doi.org/10.1111/1467-9574.00104openalex-snapshot
Polyhedral techniques in combinatorial optimization II: applications and computations
inferred← citeshttps://doi.org/10.1137/070698051openalex-snapshot
Partial Gröbner Bases for Multiobjective Integer Linear Optimization
inferred← citeshttps://doi.org/10.1137/140976868openalex-snapshot
On the Circuit Diameter of Dual Transportation Polyhedra
inferred← citeshttps://doi.org/10.1137/22m1508005openalex-snapshot
Exact Quantization of Multistage Stochastic Linear Problems
inferred← citeshttps://doi.org/10.1145/3666000.3669706openalex-snapshot
Exploring the Geometric Buchberger Algorithm in Integer Programming
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.27.4.681.305openalex-snapshot
The Complexity of Generic Primal Algorithms for Solving General Integer Programs
inferred← citeshttps://doi.org/10.1287/opre.2019.1842openalex-snapshot
Solving Stochastic and Bilevel Mixed-Integer Programs via a Generalized Value Function
inferred← citeshttps://doi.org/10.2748/tmj/1178224932openalex-snapshot
On the complexity of smooth projective toric varieties
inferred← citeshttps://doi.org/10.3389/fcomp.2023.1286860openalex-snapshot
Quantum annealing research at CMU: algorithms, hardware, applications
inferred← citeshttps://doi.org/10.35376/10324/3726openalex-snapshot
A Combinatorial Commutative Algebra Approach to Complete Decoding
inferred← citeshttps://doi.org/10.37236/11122openalex-snapshot
On Gröbner Basis and Cohen-Macaulay Property of Closed Path Polyominoes
inferred← citeshttps://doi.org/10.4064/aa166-3-4openalex-snapshot
A note on minimal zero-sum sequences over Z
inferred← citeshttps://doi.org/10.4310/mrl.2008.v15.n6.a11openalex-snapshot
On the Universal Gröbner bases of varieties of minimal degree
inferred← citeshttps://doi.org/10.48550/arxiv.1004.0840openalex-snapshot
Equality of Graver bases and universal Gröbner bases of colored partition identities
inferred← citeshttps://doi.org/10.48550/arxiv.1401.0715openalex-snapshot
A Note on Minimal zero-sum sequences over ${\mathbb Z}$
inferred← citeshttps://doi.org/10.48550/arxiv.1503.05252openalex-snapshot
Circuit diameter and Klee-Walkup constructions
inferred← citeshttps://doi.org/10.48550/arxiv.1810.01440openalex-snapshot
A Novel Algebraic Geometry Compiling Framework for Adiabatic Quantum Computations
inferred← citeshttps://doi.org/10.48550/arxiv.1903.08270openalex-snapshot
Minimizing polynomial functions on quantum computers
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.2007.13473openalex-snapshot
Limit Laws for Empirical Optimal Solutions in Stochastic Linear Programs
inferred← citeshttps://doi.org/10.48550/arxiv.alg-geom/9410032openalex-snapshot
The geometry of A-graded algebras
inferred← citeshttps://doi.org/10.48550/arxiv.alg-geom/9611010openalex-snapshot
On the Complexity of Smooth Projective Toric Varieties
inferred← citeshttps://doi.org/10.48550/arxiv.math/0012197openalex-snapshot
The vertex ideal of a lattice
inferred← citeshttps://doi.org/10.48550/arxiv.math/0110034openalex-snapshot
An Algebraic Perspective of Group Relaxations
inferred← citeshttps://doi.org/10.48550/arxiv.math/0206159openalex-snapshot
Dualistic computational algebraic analyses of primal and dual minimum cost flow problems on acyclic tournament graphs
inferred← citeshttps://doi.org/10.48550/arxiv.math/9810180openalex-snapshot
THE SATURATION CONJECTURE (AFTER A. KNUTSON AND T. TAO)
inferred← citeshttps://doi.org/10.53846/goediss-458openalex-snapshot
Limit Laws for Empirical Optimal Transport
inferred← citeshttps://doi.org/10.5802/alco.425openalex-snapshot
Numerical semigroups, polyhedra, and posets IV: walking the faces of the Kunz cone
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.