On the public citation graph

Integral Extreme Points

0 signed · 119 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 points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/9781118033142.biblioopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1002/9781118627372.refsopenalex-snapshot
References
inferred← citeshttps://doi.org/10.1002/net.3230060406openalex-snapshot
On totally unimodular matrices
inferred← citeshttps://doi.org/10.1002/net.3230070406openalex-snapshot
Unimodular matrices of flow problems with additional constraints
inferred← citeshttps://doi.org/10.1002/net.3230080204openalex-snapshot
Network topology and integral multicommodity flow problems
inferred← citeshttps://doi.org/10.1007/3-540-29297-7_5openalex-snapshot
Integer Programming
inferred← citeshttps://doi.org/10.1007/3-540-45470-5_21openalex-snapshot
On Identifying Simple and Quantified Lattice Points in the 2SAT Polytope
inferred← citeshttps://doi.org/10.1007/3-540-69346-7_16openalex-snapshot
Polyhedral Combinatorics of Benzenoid Problems
inferred← citeshttps://doi.org/10.1007/978-1-4419-7997-1_79openalex-snapshot
Simplicial Methods for Approximating Fixed Point with Applications in Combinatorial Optimizations
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-031-02334-7openalex-snapshot
Analysis Techniques for Information Security
inferred← citeshttps://doi.org/10.1007/978-3-031-23101-8_21openalex-snapshot
A Faster Algorithm for Determining the Linear Feasibility of Systems of BTVPI Constraints
inferred← citeshttps://doi.org/10.1007/978-3-031-71294-4_6openalex-snapshot
A Certifying Algorithm for Linear (and Integer) Feasibility in Horn Constraint Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-68279-0_9openalex-snapshot
Lagrangian Relaxation for Integer Programming
inferred← citeshttps://doi.org/10.1007/978-3-540-70960-2_6openalex-snapshot
On the Synthetic Generation of Semantic Web Schemas
inferred← citeshttps://doi.org/10.1007/978-3-540-71844-4_5openalex-snapshot
Integer Programming
inferred← citeshttps://doi.org/10.1007/978-3-540-76919-4_5openalex-snapshot
Ganzzahlige Optimierung
inferred← citeshttps://doi.org/10.1007/978-3-642-25401-7_5openalex-snapshot
Ganzzahlige Optimierung
inferred← citeshttps://doi.org/10.1007/978-3-642-46516-1_19openalex-snapshot
Reference
inferred← citeshttps://doi.org/10.1007/978-3-642-46618-2_15openalex-snapshot
Some Considerations about Computational Complexity for Multi Objective Combinatorial Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-87729-2_8openalex-snapshot
Auswahl von theoriebezogenen Veröffentlichungen
inferred← citeshttps://doi.org/10.1007/978-3-662-12273-0_10openalex-snapshot
Combinatorial Optimization: An Introduction
inferred← citeshttps://doi.org/10.1007/978-3-662-21708-5_5openalex-snapshot
Integer Programming
inferred← citeshttps://doi.org/10.1007/978-3-662-21711-5_5openalex-snapshot
Integer Programming
inferred← citeshttps://doi.org/10.1007/978-3-662-56039-6_5openalex-snapshot
Integer Programming
inferred← citeshttps://doi.org/10.1007/978-3-662-57691-5_5openalex-snapshot
Ganzzahlige Optimierung
inferred← citeshttps://doi.org/10.1007/978-4-431-55060-0_8openalex-snapshot
Computing Optimal Cycles of Homology Groups
inferred← citeshttps://doi.org/10.1007/978-88-470-1523-4_5openalex-snapshot
Programmazione intera
inferred← citeshttps://doi.org/10.1007/978-94-011-7557-9_14openalex-snapshot
Characterisations of Totally Unimodular, Balanced and Perfect Matrices
inferred← citeshttps://doi.org/10.1007/bf01084282openalex-snapshot
Discrete extremal problems
inferred← citeshttps://doi.org/10.1007/bf01584235openalex-snapshot
Polynomial algorithms for a class of linear programs
inferred← citeshttps://doi.org/10.1007/bfb0120690openalex-snapshot
Lagrangean relaxation for integer programming
inferred← citeshttps://doi.org/10.1007/bfb0121038openalex-snapshot
Mathematical Programming Essays in Honor of George B. Dantzig Part I
inferred← citeshttps://doi.org/10.1007/bfb0121070openalex-snapshot
Mathematical Programming Essays in Honor of George B. Dantzig Part II
inferred← citeshttps://doi.org/10.1007/s10107-012-0518-yopenalex-snapshot
Testing additive integrality gaps
inferred← citeshttps://doi.org/10.1007/s10107-020-01514-0openalex-snapshot
Box-total dual integrality, box-integrality, and equimodular matrices
inferred← citeshttps://doi.org/10.1007/s10107-020-01546-6openalex-snapshot
Computation and efficiency of potential function minimizers of combinatorial congestion games
inferred← citeshttps://doi.org/10.1007/s10472-022-09800-7openalex-snapshot
On the lengths of tree-like and Dag-like cutting plane refutations of Horn constraint systems
inferred← citeshttps://doi.org/10.1007/s41468-024-00181-wopenalex-snapshot
From finite vector field data to combinatorial dynamical systems in the sense of Forman
inferred← citeshttps://doi.org/10.1016/0012-365x(73)90167-2openalex-snapshot
Edmonds polytopes and a hierarchy of combinatorial problems
inferred← citeshttps://doi.org/10.1016/0012-365x(76)90041-8openalex-snapshot
A note on the total unimodularity of matrices
inferred← citeshttps://doi.org/10.1016/0024-3795(78)90058-7openalex-snapshot
Local unimodularity of matrix-vector pairs
inferred← citeshttps://doi.org/10.1016/0024-3795(80)90183-4openalex-snapshot
Complement total unimodularity
inferred← citeshttps://doi.org/10.1016/0024-3795(82)90129-xopenalex-snapshot
Some classes of integral matrices
inferred← citeshttps://doi.org/10.1016/0095-8956(92)90045-yopenalex-snapshot
A decomposition theory for matroids. VII. Analysis of minimal violation matrices
inferred← citeshttps://doi.org/10.1016/0167-6377(88)90024-7openalex-snapshot
Total unimodularity and the Euler-subgraph problem
inferred← citeshttps://doi.org/10.1016/0167-6377(93)90005-2openalex-snapshot
k-Integrality, an extension of total unimodularity
inferred← citeshttps://doi.org/10.1016/0167-9236(94)90076-0openalex-snapshot
Logic decisions under constraints
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90389-wopenalex-snapshot
Integer programs for logic constraint satisfaction
inferred← citeshttps://doi.org/10.1016/0898-1221(81)90118-8openalex-snapshot
The multicommodity assignment problem: a network aggregation heuristic
inferred← citeshttps://doi.org/10.1016/0925-2312(94)00005-0openalex-snapshot
Connectionist networks for pivot selection in linear programming
inferred← citeshttps://doi.org/10.1016/b978-0-12-358350-5.50007-5openalex-snapshot
A Survey of Integer Programming Emphasizing Computation and Relations among Models
inferred← citeshttps://doi.org/10.1016/b978-0-12-545075-1.50016-xopenalex-snapshot
References
inferred← citeshttps://doi.org/10.1016/b978-0-12-682150-5.50014-3openalex-snapshot
References††The first comprehensive references list is due to Balinski and Spielberg (1969). A later list appears in the work of Garfinkel and Nemhauser (1972b).
inferred← citeshttps://doi.org/10.1016/b978-0-12-701225-4.50017-3openalex-snapshot
RETRACTED: References
inferred← citeshttps://doi.org/10.1016/b978-0-444-89597-4.50006-8openalex-snapshot
Lattice Points
inferred← citeshttps://doi.org/10.1016/j.cosrev.2026.100928openalex-snapshot
A horizon tour of box-total dual integrality
inferred← citeshttps://doi.org/10.1016/j.dam.2018.11.021openalex-snapshot
On total f -domination: Polyhedral and algorithmic results
inferred← citeshttps://doi.org/10.1016/j.disc.2006.03.009openalex-snapshot
Edmonds polytopes and a hierarchy of combinatorial problems
inferred← citeshttps://doi.org/10.1016/j.is.2011.09.005openalex-snapshot
PoweRGen: A power-law based generator of RDFS schemas
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.08.012openalex-snapshot
Analyzing fractional Horn constraint systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.02.033openalex-snapshot
Minimum power partial multi-cover on a line
inferred← citeshttps://doi.org/10.1016/s0012-365x(03)00095-5openalex-snapshot
Rational and integral k-regular matrices
inferred← citeshttps://doi.org/10.1016/s0377-2217(96)00071-9openalex-snapshot
Linear programs for constraint satisfaction problems
inferred← citeshttps://doi.org/10.1016/s0924-6509(08)70105-3openalex-snapshot
WITHDRAWN: References
inferred← citeshttps://doi.org/10.1057/jors.1977.181openalex-snapshot
Mathematical Programming Studies
inferred← citeshttps://doi.org/10.1080/0025570x.1984.11977086openalex-snapshot
An Application of Graph Theory and Integer Programming: Chessboard Non-Attacking Puzzles
inferred← citeshttps://doi.org/10.1080/03155986.1971.11731484openalex-snapshot
Single-Stage Linear Programming Zero-One Solutions to Some Travelling Salesman Type Problems*
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.001.0001openalex-snapshot
The Nature of Computation
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.002.0003openalex-snapshot
Copyright Page
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.002.0004openalex-snapshot
Dedication
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.002.0006openalex-snapshot
Figure Credits
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.002.0007openalex-snapshot
Preface
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0001openalex-snapshot
Prologue
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0002openalex-snapshot
The Basics
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0003openalex-snapshot
Insights and Algorithms
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0004openalex-snapshot
Needles in a Haystack: the Class NP
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0005openalex-snapshot
Who is the Hardest One of All? NP-Completeness
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0006openalex-snapshot
The Deep Question: P vs. NP
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0007openalex-snapshot
The Grand Unified Theory of Computation
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0008openalex-snapshot
Memory, Paths, and Games
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0009openalex-snapshot
Optimization and Approximation
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0010openalex-snapshot
Randomized Algorithms
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0011openalex-snapshot
Interaction and Pseudorandomness
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0012openalex-snapshot
Random Walks and Rapid Mixing
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0013openalex-snapshot
Counting, Sampling, and Statistical Physics
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0014openalex-snapshot
When Formulas Freeze: Phase Transitions in Computation
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0015openalex-snapshot
Quantum Computation
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.005.0001openalex-snapshot
Mathematical Tools
inferred← citeshttps://doi.org/10.1109/69.87983openalex-snapshot
Optimizing vote and quorum assignments for reading and writing replicated data
inferred← citeshttps://doi.org/10.1109/apccas.2006.342089openalex-snapshot
A Total Unimodularity Based Branch-and-Bound Method for Integer Programming
inferred← citeshttps://doi.org/10.1109/cdc.2012.6426790openalex-snapshot
Exact convex formulations of network-oriented optimal operator placement
inferred← citeshttps://doi.org/10.1109/icde.1989.47226openalex-snapshot
Optimizing vote and quorum assignments for reading and writing replicated data
inferred← citeshttps://doi.org/10.1137/0117092openalex-snapshot
Total Unimodularity of Matrices
inferred← citeshttps://doi.org/10.1137/0135027openalex-snapshot
Algebraic Characterizations of Unimodular Matrices
inferred← citeshttps://doi.org/10.1137/1.9780898717105openalex-snapshot
Combinatorial Optimization
inferred← citeshttps://doi.org/10.1137/100800245openalex-snapshot
Optimal Homologous Cycles, Total Unimodularity, and Linear Programming
inferred← citeshttps://doi.org/10.1145/1806689.1806721openalex-snapshot
Optimal homologous cycles, total unimodularity, and linear programming
inferred← citeshttps://doi.org/10.1145/1998196.1998218openalex-snapshot
The least spanning area of a knot and the optimal bounding chain problem
inferred← citeshttps://doi.org/10.1145/3033274.3085149openalex-snapshot
Potential Function Minimizers of Combinatorial Congestion Games
inferred← citeshttps://doi.org/10.1214/15-aoas805openalex-snapshot
Network tomography for integer-valued traffic
inferred← citeshttps://doi.org/10.1287/opre.26.4.673openalex-snapshot
Technical Note—A Single-Commodity Transformation for Certain Multicommodity Networks
inferred← citeshttps://doi.org/10.1287/opre.34.1.63openalex-snapshot
Approximation Formulations for the Single-Product Capacitated Lot Size Problem
inferred← citeshttps://doi.org/10.1364/josaa.27.000605openalex-snapshot
Edgelist phase unwrapping algorithm for time series InSAR analysis
inferred← citeshttps://doi.org/10.20382/jocg.v4i1a6openalex-snapshot
Simplicial Flat Norm with Scale
inferred← citeshttps://doi.org/10.2200/s00260ed1v01y201003spt002openalex-snapshot
Analysis Techniques for Information Security
inferred← citeshttps://doi.org/10.23919/acc.1992.4792737openalex-snapshot
Fault Detection and Initial State Verification by Linear Programming for a Class of Petri Nets
inferred← citeshttps://doi.org/10.2514/1.i011889openalex-snapshot
Coupled Task Assignment for Hierarchical Multi-Agent Systems: A Nested Hungarian Approach
inferred← citeshttps://doi.org/10.2514/6.2026-2747openalex-snapshot
Coupled Task Assignment for Hierarchical Multi-Agent Systems in Disaster Response Missions: A Nested Hungarian Approach
inferred← citeshttps://doi.org/10.32917/hmj/1206128715openalex-snapshot
3-valued problem and reduction of some integer programming problems
inferred← citeshttps://doi.org/10.3390/su141811752openalex-snapshot
Fair Assignment for Reserved Nucleic Acid Testing
inferred← citeshttps://doi.org/10.33915/etd.3843openalex-snapshot
Analyzing Satisfiability and Refutability in Selected Constraint Systems
inferred← citeshttps://doi.org/10.48550/arxiv.1001.0338openalex-snapshot
Optimal Homologous Cycles, Total Unimodularity, and Linear Programming
inferred← citeshttps://doi.org/10.48550/arxiv.1012.3030openalex-snapshot
The Least Spanning Area of a Knot and the Optimal Bounding Chain Problem
inferred← citeshttps://doi.org/10.48550/arxiv.1408.5954openalex-snapshot
Data-inspired advances in geometric measure theory: generalized surface and shape metrics
inferred← citeshttps://doi.org/10.48550/arxiv.1804.08977openalex-snapshot
Principally Box-integer Polyhedra and Equimodular Matrices
inferred← citeshttps://doi.org/10.48550/arxiv.2106.05644openalex-snapshot
Optimal Non-Convex Exact Recovery in Stochastic Block Model via Projected Power Method
inferred← citeshttps://doi.org/10.5860/choice.39-4018openalex-snapshot
Combinatorial optimization: packing and covering
inferred← citeshttps://doi.org/10.9734/arjom/2024/v20i8813openalex-snapshot
Polynomial Time Linear Programs for Hard Constraint Satisfaction Problems
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.