On the public citation graph

On the acyclic subgraph polytope

0 signed · 107 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.1007/bf01582010openalex-snapshot
Facets of the linear ordering polytope
inferredcites →https://doi.org/10.1007/bf02579273openalex-snapshot
The ellipsoid method and its consequences in combinatorial optimization
inferredcites →https://doi.org/10.1007/bf02932410openalex-snapshot
Optimal triangulation of large real world input-output matrices
inferredcites →https://doi.org/10.1016/0377-2217(81)90005-9openalex-snapshot
A branch and bound algorithm for the acyclic subgraph problem
inferredcites →https://doi.org/10.1112/jlms/s2-17.3.369openalex-snapshot
A Minimax Theorem for Directed Graphs
inferredcites →https://doi.org/10.1287/opre.32.6.1195openalex-snapshot
A Cutting Plane Algorithm for the Linear Ordering Problem

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9781118627372.refsopenalex-snapshot
References
inferred← citeshttps://doi.org/10.1002/net.21941openalex-snapshot
A branch‐and‐cut approach for the least cost influence problem on social networks
inferred← citeshttps://doi.org/10.1002/net.22038openalex-snapshot
Combinatorial acyclicity models for potential‐based flows
inferred← citeshttps://doi.org/10.1006/jmps.1999.1288openalex-snapshot
Signed Orders, Choice Probabilities, and Linear Polytopes
inferred← citeshttps://doi.org/10.1007/3-540-44929-9_15openalex-snapshot
On the Hardness of Approximating Some NP-Optimization Problems Related to Minimum Linear Ordering Problem
inferred← citeshttps://doi.org/10.1007/3-540-44969-8_11openalex-snapshot
Software Packages
inferred← citeshttps://doi.org/10.1007/3-540-45535-3_26openalex-snapshot
Fences Are Futile: On Relaxations for the Linear Ordering Problem
inferred← citeshttps://doi.org/10.1007/3-540-45581-7_19openalex-snapshot
Coping with Inconsistent Constraint Specifications
inferred← citeshttps://doi.org/10.1007/3-540-45718-6_15openalex-snapshot
Optimizing Register Spills for Eager Functional Languages
inferred← citeshttps://doi.org/10.1007/3-540-45848-4_52openalex-snapshot
AGD: A Library of Algorithms for Graph Drawing
inferred← citeshttps://doi.org/10.1007/3-540-45875-1_24openalex-snapshot
Graph Drawing Algorithm Engineering with AGD
inferred← citeshttps://doi.org/10.1007/3-540-46632-0_29openalex-snapshot
Reverse Center Location Problem
inferred← citeshttps://doi.org/10.1007/3-540-61310-2_31openalex-snapshot
The strongest facets of the acyclic subgraph polytope are unknown
inferred← citeshttps://doi.org/10.1007/3-540-61310-2_32openalex-snapshot
Transitive packing
inferred← citeshttps://doi.org/10.1007/3-540-61310-2_33openalex-snapshot
A polyhedral approach to the feedback vertex set problem
inferred← citeshttps://doi.org/10.1007/978-1-4684-6381-1_2openalex-snapshot
Social Welfare and Aggregation Procedures: Combinatorial and Algorithmic Aspects
inferred← citeshttps://doi.org/10.1007/978-3-319-71147-8_12openalex-snapshot
Listing Acyclic Subgraphs and Subgraphs of Bounded Girth in Directed Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-91908-9_3openalex-snapshot
Computing in Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-3-540-68279-0_12openalex-snapshot
Fifty-Plus Years of Combinatorial Integer Programming
inferred← citeshttps://doi.org/10.1007/978-3-540-76796-1_2openalex-snapshot
Facet Generating Techniques
inferred← citeshttps://doi.org/10.1007/978-3-642-18638-7_7openalex-snapshot
AGD — A Library of Algorithms for Graph Drawing
inferred← citeshttps://doi.org/10.1007/978-3-642-38189-8openalex-snapshot
Facets of Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-3-642-38189-8_1openalex-snapshot
Martin Grötschel—The Early Years in Bonn and Augsburg
inferred← citeshttps://doi.org/10.1007/978-3-642-82450-0_3openalex-snapshot
LP-Based Combinatorial Problem Solving
inferred← citeshttps://doi.org/10.1007/978-4-431-55861-3_24openalex-snapshot
Ranking Smartphone Apps Based on Users’ Behavior Records
inferred← citeshttps://doi.org/10.1007/978-94-009-5315-4_7openalex-snapshot
Acyclic Subdigraphs and Linear Orderings: Polytopes, Facets, and a Cutting Plane Algorithm
inferred← citeshttps://doi.org/10.1007/bf00249646openalex-snapshot
A new heuristic algorithm solving the linear ordering problem
inferred← citeshttps://doi.org/10.1007/bf01582010openalex-snapshot
Facets of the linear ordering polytope
inferred← citeshttps://doi.org/10.1007/bf01582905openalex-snapshot
Computational results of an interior point algorithm for large scale linear programming
inferred← citeshttps://doi.org/10.1007/bf01589100openalex-snapshot
Facets and lifting procedures for the set covering polytope
inferred← citeshttps://doi.org/10.1007/bf02592097openalex-snapshot
On the partial order polytope of a digraph
inferred← citeshttps://doi.org/10.1007/bf02592196openalex-snapshot
{0, 1/2}-Chvátal-Gomory cuts
inferred← citeshttps://doi.org/10.1007/bf02614506openalex-snapshot
On the monotonization of polyhedra
inferred← citeshttps://doi.org/10.1007/s00224-017-9777-6openalex-snapshot
Exact Localisations of Feedback Sets
inferred← citeshttps://doi.org/10.1007/s10107-018-1288-yopenalex-snapshot
Least cost influence propagation in (social) networks
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.1007/s10878-022-00971-xopenalex-snapshot
A polyhedral approach to least cost influence maximization in social networks
inferred← citeshttps://doi.org/10.1016/0020-0190(94)00086-7openalex-snapshot
Approximations for the maximum acyclic subgraph problem
inferred← citeshttps://doi.org/10.1016/0024-3795(89)90476-xopenalex-snapshot
On cutting-plane proofs in combinatorial optimization
inferred← citeshttps://doi.org/10.1016/0095-8956(91)90076-vopenalex-snapshot
On a composition of independence systems by circuit identification
inferred← citeshttps://doi.org/10.1016/0165-4896(92)90036-5openalex-snapshot
Generalizing the concept of binary choice systems induced by rankings: one way of probabilizing deterministic measurement structures
inferred← citeshttps://doi.org/10.1016/0165-4896(92)90039-8openalex-snapshot
Geometric and combinatorial properties of the polytope of binary choice probabilities
inferred← citeshttps://doi.org/10.1016/0166-218x(92)00151-bopenalex-snapshot
More facets from fences for linear ordering and acyclic subgraph polytopes
inferred← citeshttps://doi.org/10.1016/0166-218x(94)00042-copenalex-snapshot
The reversing number of a diagraph
inferred← citeshttps://doi.org/10.1016/0377-2217(89)90442-6openalex-snapshot
Median linear orders: Heuristics and a branch and bound algorithm
inferred← citeshttps://doi.org/10.1016/0377-2217(92)90046-copenalex-snapshot
A graph-theoretic heuristic for designing loop-layout manufacturing systems
inferred← citeshttps://doi.org/10.1016/0377-2217(94)90367-0openalex-snapshot
Polyhedral structure and properties of a model for layout design
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50032-4openalex-snapshot
10.1016/b978-044488002-4/50032-4
inferred← citeshttps://doi.org/10.1016/j.artint.2015.03.003openalex-snapshot
Integer Linear Programming for the Bayesian network structure learning problem
inferred← citeshttps://doi.org/10.1016/j.cels.2026.101615openalex-snapshot
The tree labeling polytope: A unified approach to ancestral reconstruction problems
inferred← citeshttps://doi.org/10.1016/j.cor.2024.106857openalex-snapshot
Influence optimization in networks: New formulations and valid inequalities
inferred← citeshttps://doi.org/10.1016/j.dam.2004.07.009openalex-snapshot
Multiprocessor scheduling under precedence constraints: Polyhedral results
inferred← citeshttps://doi.org/10.1016/j.dam.2026.03.053openalex-snapshot
A polyhedral study of a relaxation of the routing and spectrum allocation problem
inferred← citeshttps://doi.org/10.1016/j.disopt.2005.10.007openalex-snapshot
How to recycle your facets
inferred← citeshttps://doi.org/10.1016/j.disopt.2015.09.001openalex-snapshot
Arc-based integer programming formulations for three variants of proportional symbol maps
inferred← citeshttps://doi.org/10.1016/j.ejor.2006.03.071openalex-snapshot
The Linear Ordering Problem with cumulative costs
inferred← citeshttps://doi.org/10.1016/j.ejor.2007.02.044openalex-snapshot
A branch-and-bound algorithm for the linear ordering problem with cumulative costs
inferred← citeshttps://doi.org/10.1016/j.endm.2004.03.038openalex-snapshot
Computing Optimal Discrete Morse Functions
inferred← citeshttps://doi.org/10.1016/j.endm.2013.10.039openalex-snapshot
Arc-based integer programming formulations for three variants of proportional symbol maps
inferred← citeshttps://doi.org/10.1016/j.entcs.2019.08.017openalex-snapshot
On Computing the Path Number of a Graph
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.orl.2011.07.003openalex-snapshot
On the membership problem for the -closure
inferred← citeshttps://doi.org/10.1016/s0166-218x(03)00444-xopenalex-snapshot
On approximability of linear ordering and related NP-optimization problems on graphs
inferred← citeshttps://doi.org/10.1016/s0167-6377(98)00024-8openalex-snapshot
Optimal facility layout design
inferred← citeshttps://doi.org/10.1016/s0167-739x(02)00035-3openalex-snapshot
Optimizing register spills for eager functional languages
inferred← citeshttps://doi.org/10.1016/s0377-2217(00)00230-7openalex-snapshot
Workload balancing and loop layout in the design of a flexible manufacturing system
inferred← citeshttps://doi.org/10.1016/s1571-0653(05)80081-2openalex-snapshot
On Approximability of Linear Ordering and Related NP-optimization Problems on Graphs (Extended Abstract)
inferred← citeshttps://doi.org/10.1023/a:1011493126498openalex-snapshot
On Disjunctive Cuts for Combinatorial Optimization
inferred← citeshttps://doi.org/10.1051/ita:2001121openalex-snapshot
On the Hardness of Approximating Some NP-optimization Problems Related to Minimum Linear Ordering Problem
inferred← citeshttps://doi.org/10.1051/ro:2007021openalex-snapshot
A branch-and-cut algorithm for a resource-constrained scheduling problem
inferred← citeshttps://doi.org/10.1051/ro:2008028openalex-snapshot
Acyclic Orientations with Path Constraints
inferred← citeshttps://doi.org/10.1093/biomet/asaf032openalex-snapshot
Integer programming for learning directed acyclic graphs from nonidentifiable Gaussian models
inferred← citeshttps://doi.org/10.1093/biomet/asy057openalex-snapshot
Constrained likelihood for reconstructing a directed acyclic Gaussian graph
inferred← citeshttps://doi.org/10.1103/physreva.111.052211openalex-snapshot
Möbius games and other Bell tests for relativity
inferred← citeshttps://doi.org/10.1137/s0895480104445885openalex-snapshot
Computing Optimal Morse Matchings
inferred← citeshttps://doi.org/10.1137/s0895480190182691openalex-snapshot
Compositions of Graphs and Polyhedra IV: Acyclic Spanning Subgraphs
inferred← citeshttps://doi.org/10.1137/s1052623499363256openalex-snapshot
Transitive Packing: A Unifying Concept in Combinatorial Optimization
inferred← citeshttps://doi.org/10.1145/1250790.1250806openalex-snapshot
How to rank with few errors
inferred← citeshttps://doi.org/10.1145/1536414.1536455openalex-snapshot
Integrality gaps for Sherali-Adams relaxations
inferred← citeshttps://doi.org/10.1145/3446429openalex-snapshot
An Exact Method for the Minimum Feedback Arc Set Problem
inferred← citeshttps://doi.org/10.1145/3447652openalex-snapshot
Tight Localizations of Feedback Sets
inferred← citeshttps://doi.org/10.1145/3545001openalex-snapshot
Comments on “An Exact Method for the Minimum Feedback Arc Set Problem”
inferred← citeshttps://doi.org/10.1201/b15385-16openalex-snapshot
- Hierarchical Drawing Algorithms
inferred← citeshttps://doi.org/10.1287/ijoo.2019.0012openalex-snapshot
A Branch-and-Cut Approach for the Weighted Target Set Selection Problem on Social Networks
inferred← citeshttps://doi.org/10.1287/ijoo.2019.0040openalex-snapshot
Integer Programming for Learning Directed Acyclic Graphs from Continuous Data
inferred← citeshttps://doi.org/10.1287/moor.12.3.451openalex-snapshot
Generalizations of Cliques, Odd Cycles and Anticycles and Their Relation to Independence System Polyhedra
inferred← citeshttps://doi.org/10.1287/msom.2022.0211openalex-snapshot
The Driver-Aide Problem: Coordinated Logistics for Last-Mile Delivery
inferred← citeshttps://doi.org/10.15807/jorsj.65.67openalex-snapshot
STRONG CONDORCET CRITERION FOR THE LINEAR ORDERING PROBLEM
inferred← citeshttps://doi.org/10.1590/0101-7438.2023.043.00275468openalex-snapshot
COMBINATORIAL DUAL BOUNDS ON THE LEAST COST INFLUENCE PROBLEM
inferred← citeshttps://doi.org/10.1613/jair.5203openalex-snapshot
Bayesian Network Structure Learning with Integer Programming: Polytopes, Facets and Complexity
inferred← citeshttps://doi.org/10.17771/pucrio.acad.50960openalex-snapshot
UM NOVO ALGORITMO BRANCH-AND-CUT PARA O PROBLEMA DE INFLUÊNCIA DE MENOR CUSTO GENERALIZADO EM REDES
inferred← citeshttps://doi.org/10.20868/upm.thesis.43237openalex-snapshot
Long-term optimal hydropower reservoir operation with minimum flows and maximum ramping rates
inferred← citeshttps://doi.org/10.3233/jifs-241585openalex-snapshot
The star-chromatic number of snarks and its variants
inferred← citeshttps://doi.org/10.3934/fods.2021010openalex-snapshot
On the linear ordering problem and the rankability of data
inferred← citeshttps://doi.org/10.48550/arxiv.1309.6825openalex-snapshot
Advances in Bayesian Network Learning using Integer Programming
inferred← citeshttps://doi.org/10.48550/arxiv.1702.07612openalex-snapshot
Exact Localisations of Feedback Sets
inferred← citeshttps://doi.org/10.48550/arxiv.2102.03129openalex-snapshot
Integer Programming for Causal Structure Learning in the Presence of Latent Variables
inferred← citeshttps://doi.org/10.59254/sbpo-2020-122560openalex-snapshot
Tighter Dual Bounds on the Least Cost Influence Problem
inferred← citeshttps://doi.org/10.70675/1a5cc40dz5aeez43ebzb7d3zbe6c57119b0bopenalex-snapshot
Exploring Combinatorial Aspects of the Stop Number Problem
inferred← citeshttps://doi.org/10.70675/ec68d32bzfc9dz4986z964cz413d06e9337fopenalex-snapshot
Fixed cardinality linear ordering problem, polyhedral studies and solution methods
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.