On the public citation graph

0, 1/2‐Cuts and the Linear Ordering Problem: Surfaces That Define Facets

https://doi.org/10.1137/s0895480104440985
0 signed · 36 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.1006/jmps.1995.1003openalex-snapshot
Random Utility Representation of Binary Choice Probabilities: Critical Graphs Yielding Critical Necessary Conditions
inferredcites →https://doi.org/10.1007/3-540-45535-3_26openalex-snapshot
Fences Are Futile: On Relaxations for the Linear Ordering Problem
inferredcites →https://doi.org/10.1007/3-540-47867-1_8openalex-snapshot
Polynomial-Time Separation of Simple Comb Inequalities
inferredcites →https://doi.org/10.1007/3-540-61310-2_31openalex-snapshot
The strongest facets of the acyclic subgraph polytope are unknown
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2_9openalex-snapshot
Reducibility among Combinatorial Problems
inferredcites →https://doi.org/10.1007/978-3-540-76649-0openalex-snapshot
Using the Borsuk–Ulam Theorem
inferredcites →https://doi.org/10.1007/bf01200760openalex-snapshot
Packing directed circuits fractionally
inferredcites →https://doi.org/10.1007/bf01582010openalex-snapshot
Facets of the linear ordering polytope
inferredcites →https://doi.org/10.1007/bf02592196openalex-snapshot
{0, 1/2}-Chvátal-Gomory cuts
inferredcites →https://doi.org/10.1007/s10107-003-0402-xopenalex-snapshot
Binary clutter inequalities for integer programs
inferredcites →https://doi.org/10.1007/s101079900107openalex-snapshot
On the separation of maximally violated mod-k cuts
inferredcites →https://doi.org/10.1016/0022-2496(90)90014-zopenalex-snapshot
Random utility representation of binary choice probabilities: A new class of necessary conditions
inferredcites →https://doi.org/10.1016/0165-4896(92)90038-7openalex-snapshot
Induced binary probabilities and the linear ordering polytope: a status report
inferredcites →https://doi.org/10.1016/0165-4896(92)90039-8openalex-snapshot
Geometric and combinatorial properties of the polytope of binary choice probabilities
inferredcites →https://doi.org/10.1016/0166-218x(92)00151-bopenalex-snapshot
More facets from fences for linear ordering and acyclic subgraph polytopes
inferredcites →https://doi.org/10.1016/0304-3975(77)90005-6openalex-snapshot
Cyclic ordering is NP-complete
inferredcites →https://doi.org/10.1016/s0166-218x(00)00312-7openalex-snapshot
Determining the automorphism group of the linear ordering polytope
inferredcites →https://doi.org/10.1112/blms/19.1.84openalex-snapshot
THE LINEAR ORDERING PROBLEM: ALGORITHMS AND APPLICATIONS (Research and Exposition in Mathematics 8)
inferredcites →https://doi.org/10.1137/s0895480196300145openalex-snapshot
New Facets of the Linear Ordering Polytope
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.5860/choice.41-5956openalex-snapshot
Using the Borsuk-Ulam theorem: lectures on topological methods in combinatorics and geometry

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.2545370openalex-extracted
Recognizing Single-Peaked Preferences on Aggregated Choice Data
inferred← citeshttps://doi.org/10.1007/978-3-540-75520-3_61openalex-snapshot
Algorithms to Separate ${\{0,\frac{1}{2}\}}$ -Chvátal-Gomory Cuts
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/s10288-007-0036-6openalex-snapshot
A survey on the linear ordering problem for weighted or unweighted tournaments
inferred← citeshttps://doi.org/10.1007/s10479-009-0648-7openalex-snapshot
An updated survey on the linear ordering problem for weighted or unweighted tournaments
inferred← citeshttps://doi.org/10.1016/j.cor.2018.03.001openalex-snapshot
Testing probabilistic models of choice using column generation
inferred← citeshttps://doi.org/10.1016/j.disopt.2005.10.007openalex-snapshot
How to recycle your facets
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2012.03.028openalex-snapshot
Commutative algebra of statistical ranking
inferred← citeshttps://doi.org/10.1016/j.jmp.2006.01.001openalex-snapshot
Facets of the linear ordering polytope: A unification for the fence family through weighted graphs
inferred← citeshttps://doi.org/10.1016/j.jmp.2016.07.004openalex-snapshot
Primary facets of order polytopes
inferred← citeshttps://doi.org/10.1016/j.jmp.2018.08.003openalex-snapshot
Extended formulations for order polytopes through network flows
inferred← citeshttps://doi.org/10.1016/j.mathsocsci.2018.02.002openalex-snapshot
Testing a mixture model of single-peaked preferences
inferred← citeshttps://doi.org/10.1051/ro/2014056openalex-snapshot
Virtual private network design over the first Chvátal closure
inferred← citeshttps://doi.org/10.1090/memo/1072openalex-snapshot
Spectra of symmetrized shuffling operators
inferred← citeshttps://doi.org/10.1590/0101-7438.2015.035.02.0213openalex-snapshot
GRAPH PROPERTIES OF MINIMIZATION OF OPEN STACKS PROBLEMS AND A NEW INTEGER PROGRAMMING MODEL
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.