On the public citation graph
Facets of the linear ordering polytope
0 signed · 165 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.1007/bf01918332openalex-snapshot
Zwei Algorithmen zur Lösung eines komplexen Reihenfolgeproblems
inferredcites →https://doi.org/10.1007/bf02932410openalex-snapshot
Optimal triangulation of large real world input-output matrices
inferredcites →https://doi.org/10.1007/bfb0121198openalex-snapshot
On permutations and permutation polytopes
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.1515/jbnst-1968-0125openalex-snapshot
Zur Triangulation von Input-Output-Matrizen
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.4577779openalex-extracted
A Column Generation Approach for Parallel Stack Loading Problem with Conflicts
inferred← citeshttps://doi.org/10.1002/bdm.2037openalex-snapshot
The Role of Independence and Stationarity in Probabilistic Models of Binary Choice
inferred← citeshttps://doi.org/10.1002/net.20122openalex-snapshot
On extended formulations for the precedence constrained asymmetric traveling salesman problem
inferred← citeshttps://doi.org/10.1002/net.20304openalex-snapshot
On the cycle polytope of a directed graph and its relaxations
inferred← citeshttps://doi.org/10.1006/jmps.1997.1147openalex-snapshot
Probabilistic Biclassification and Random Variable Representations
inferred← citeshttps://doi.org/10.1006/jmps.1997.1173openalex-snapshot
Polytopes in Measurement and Data Analysis. Review ofLectures on Polytopes,by Günter M. Ziegler
inferred← citeshttps://doi.org/10.1006/jmps.1999.1288openalex-snapshot
Signed Orders, Choice Probabilities, and Linear Polytopes
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_365openalex-snapshot
Optimization in Leveled Graphs
inferred← citeshttps://doi.org/10.1007/3-540-32539-5_44openalex-snapshot
On the Computational Performance of a Semidefinite Programming Approach to Single Row Layout Problems
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-59408-6_41openalex-snapshot
The interval order polytope of a digraph
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-63938-1_46openalex-snapshot
A polyhedral approach to the multi-layer crossing minimization problem
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_483openalex-snapshot
Optimization in Leveled Graphs
inferred← citeshttps://doi.org/10.1007/978-0-387-77131-1_5openalex-snapshot
There Are Many Models of Transitive Preference: A Tutorial Review and Current Perspective
inferred← citeshttps://doi.org/10.1007/978-1-4612-4308-3_13openalex-snapshot
From Binary Choices to Random Utility Representations
inferred← citeshttps://doi.org/10.1007/978-1-4614-0769-0_28openalex-snapshot
Computational Approaches to Max-Cut
inferred← citeshttps://doi.org/10.1007/978-1-4614-0769-0_29openalex-snapshot
Global Approaches for Facility Layout and VLSI Floorplanning
inferred← citeshttps://doi.org/10.1007/978-1-4615-5089-1_20openalex-snapshot
The Making of Decision Theory
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-1-4757-4137-7_3openalex-snapshot
Lagrangian Heuristics for the Linear Ordering Problem
inferred← citeshttps://doi.org/10.1007/978-1-4757-4592-4_12openalex-snapshot
Combinatoric and Geometric Aspects of Some Probabilistic Choice Models — A Review
inferred← citeshttps://doi.org/10.1007/978-3-031-22039-5_7openalex-snapshot
Integer Linear Programming Reformulations for the Linear Ordering Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-23114-3_1openalex-snapshot
Beyond Theory and Data in Preference Modeling: Bringing Humans into the Loop
inferred← citeshttps://doi.org/10.1007/978-3-319-45587-7_23openalex-snapshot
A Set Covering Approach for the Double Traveling Salesman Problem with Multiple Stacks
inferred← citeshttps://doi.org/10.1007/978-3-319-50106-2_29openalex-snapshot
Crossing Minimization in Storyline Visualization
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-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-38189-8_2openalex-snapshot
Facets and Rank of Integer Polyhedra
inferred← citeshttps://doi.org/10.1007/978-3-642-61159-9_31openalex-snapshot
The Equivalence Relation Polytope and Random Classification and Clustering
inferred← citeshttps://doi.org/10.1007/978-3-642-77489-8_4openalex-snapshot
A Cutting Plane Algorithm for the Single Machine Scheduling Problem with Release Times
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-3-662-64877-3openalex-snapshot
Exact and Heuristic Methods in Combinatorial Optimization
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/bf01587093openalex-snapshot
Valid inequalities and facets of the capacitated plant location problem
inferred← citeshttps://doi.org/10.1007/bf01589110openalex-snapshot
Facets and algorithms for capacitated lot sizing
inferred← citeshttps://doi.org/10.1007/bf01721246openalex-snapshot
Recent trends in combinatorial optimization
inferred← citeshttps://doi.org/10.1007/bf02085634openalex-snapshot
A branch-and-cut algorithm for vehicle routing problems
inferred← citeshttps://doi.org/10.1007/bf02568602openalex-snapshot
Combinatorial optimization and small polytopes
inferred← citeshttps://doi.org/10.1007/bf02573963openalex-snapshot
A note on small linear-ordering polytopes
inferred← citeshttps://doi.org/10.1007/bf02592097openalex-snapshot
On the partial order polytope of a digraph
inferred← citeshttps://doi.org/10.1007/bf02614506openalex-snapshot
On the monotonization of polyhedra
inferred← citeshttps://doi.org/10.1007/bfb0021817openalex-snapshot
Exact and heuristic algorithms for 2-layer straightline crossing minimization
inferred← citeshttps://doi.org/10.1007/bfb0121051openalex-snapshot
On the facial structure of scheduling polyhedra
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/s10479-018-2977-xopenalex-snapshot
An exact algorithm for the edge coloring by total labeling problem
inferred← citeshttps://doi.org/10.1007/s10878-010-9306-xopenalex-snapshot
Revised GRASP with path-relinking for the linear ordering problem
inferred← citeshttps://doi.org/10.1007/s10878-023-01075-wopenalex-snapshot
Derivations of large classes of facet defining inequalities of the weak order polytope using ranking structures
inferred← citeshttps://doi.org/10.1007/s10878-024-01109-xopenalex-snapshot
A linear ordering problem with weighted rank
inferred← citeshttps://doi.org/10.1007/s11081-011-9135-5openalex-snapshot
A minimum violations ranking method
inferred← citeshttps://doi.org/10.1007/s11590-011-0426-8openalex-snapshot
Optimal solutions for the double row layout problem
inferred← citeshttps://doi.org/10.1007/s11590-013-0625-6openalex-snapshot
Fence facets from non-regular graphs for the linear ordering polytope
inferred← citeshttps://doi.org/10.1007/s11590-016-1047-zopenalex-snapshot
Rank aggregation in cyclic sequences
inferred← citeshttps://doi.org/10.1007/s11590-017-1207-9openalex-snapshot
An integer programming approach for the search of discretization orders in distance geometry problems
inferred← citeshttps://doi.org/10.1007/s11590-020-01651-7openalex-snapshot
A mixed-integer programming formulation of the double row layout problem based on a linear extension of a partial order
inferred← citeshttps://doi.org/10.1007/s11750-009-0096-1openalex-snapshot
Applying mod-k-cuts for solving linear ordering problems
inferred← citeshttps://doi.org/10.1007/s12532-019-00162-6openalex-snapshot
New exact approaches to row layout problems
inferred← citeshttps://doi.org/10.1007/s13675-019-00111-xopenalex-snapshot
A branch-and-cut algorithm for the target visitation problem
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)90038-7openalex-snapshot
Induced binary probabilities and the linear ordering polytope: a status report
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(88)90333-5openalex-snapshot
An inexact algorithm for the sequential ordering problem
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/b0-08-043076-7/00600-8openalex-snapshot
Characterization Theorems in Random Utility Theory
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.cie.2017.11.016openalex-snapshot
Minimizing the maximum lateness on a single machine with raw material constraints by branch-and-cut
inferred← citeshttps://doi.org/10.1016/j.cor.2012.04.016openalex-snapshot
The corridor allocation problem
inferred← citeshttps://doi.org/10.1016/j.cor.2026.107600openalex-snapshot
A unified modelling framework and improved formulations for single-hoist cyclic scheduling
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.2006.03.032openalex-snapshot
On the combinatorial structure of chromatic scheduling polytopes
inferred← citeshttps://doi.org/10.1016/j.dam.2008.05.009openalex-snapshot
A new formulation for the Traveling Deliveryman Problem
inferred← citeshttps://doi.org/10.1016/j.dam.2019.08.010openalex-snapshot
Analysis of a generalized Linear Ordering Problem via integer programming
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.03.001openalex-snapshot
A semidefinite optimization approach for the single-row layout problem with unequal dimensions
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.2008.07.001openalex-snapshot
Weighted graphs defining facets: A connection between stable set and linear ordering polytopes
inferred← citeshttps://doi.org/10.1016/j.disopt.2008.08.004openalex-snapshot
Cycle-based facets of chromatic scheduling polytopes
inferred← citeshttps://doi.org/10.1016/j.disopt.2015.10.003openalex-snapshot
An integer programming approach to optimal basic block instruction scheduling for single-issue processors
inferred← citeshttps://doi.org/10.1016/j.disopt.2016.04.005openalex-snapshot
Polyhedral results and a branch-and-cut algorithm for the double traveling Salesman problem with multiple stacks
inferred← citeshttps://doi.org/10.1016/j.disopt.2021.100641openalex-snapshot
Facets of the dynamic monopoly polytope: Linear ordering formulation
inferred← citeshttps://doi.org/10.1016/j.ejco.2023.100071openalex-snapshot
Binary programs for asymmetric betweenness problems and relations to the quadratic linear ordering problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2004.12.021openalex-snapshot
On the exact solution of a facility layout problem
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.2016.10.021openalex-snapshot
The Linear Extension Polytope of a Poset
inferred← citeshttps://doi.org/10.1016/j.eswa.2015.01.053openalex-snapshot
Metaheuristics for large-scale instances of the linear ordering problem
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.2008.08.003openalex-snapshot
Analysis of multinomial models under inequality constraints: Applications to measurement theory
inferred← citeshttps://doi.org/10.1016/j.jmp.2012.01.003openalex-snapshot
A lexicographic semiorder polytope and probabilistic representations of choice
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.2019.05.002openalex-snapshot
QTest 2.1: Quantitative testing of theories of binary choice using Bayesian inference
inferred← citeshttps://doi.org/10.1016/j.laa.2016.01.012openalex-snapshot
Diffuse scattering on graphs
inferred← citeshttps://doi.org/10.1016/j.tre.2025.104485openalex-snapshot
Spatiotemporally coordinated scheduling of suspended monorail vehicles and AGVs under a double cycling strategy in automated container terminals
inferred← citeshttps://doi.org/10.1016/s0165-0114(02)00434-7openalex-snapshot
General transitivity conditions for fuzzy reciprocal preference matrices
inferred← citeshttps://doi.org/10.1016/s0165-4896(02)00020-3openalex-snapshot
Independent random utility representations
inferred← citeshttps://doi.org/10.1016/s0166-218x(03)00224-5openalex-snapshot
Facets of linear signed order polytopes
inferred← citeshttps://doi.org/10.1016/s0195-6698(03)00009-xopenalex-snapshot
A combinatorial study of partial order polytopes
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.1017/s1930297500004502openalex-snapshot
Reply: Birnbaum’s (2012) statistical tests of independence have unknown Type-I error rates and do not replicate within participant
inferred← citeshttps://doi.org/10.1023/a:1011493126498openalex-snapshot
On Disjunctive Cuts for Combinatorial Optimization
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.1080/10556788.2024.2349093openalex-snapshot
A mixed-integer programming formulation for optimizing the double row layout problem
inferred← citeshttps://doi.org/10.1086/717165openalex-snapshot
(Ir)rationality of animal choice? A guide to testing transitivity
inferred← citeshttps://doi.org/10.1089/cmb.1997.4.433openalex-snapshot
A Branch-and-Cut Approach to Physical Mapping of Chromosomes by Unique End-Probes
inferred← citeshttps://doi.org/10.1090/memo/1072openalex-snapshot
Spectra of symmetrized shuffling operators
inferred← citeshttps://doi.org/10.1111/cgf.15087openalex-snapshot
Improving Temporal Treemaps by Minimizing Crossings
inferred← citeshttps://doi.org/10.1111/j.1467-9574.1987.tb01168.xopenalex-snapshot
Polyhedral Combinatorics in Combinatorial Optimization
inferred← citeshttps://doi.org/10.1111/j.1475-3995.2010.00778.xopenalex-snapshot
Efficient local search algorithms for the linear ordering problem
inferred← citeshttps://doi.org/10.1137/s0895480100369936openalex-snapshot
Facets of the Weak Order Polytope Derived from the Induced Partition Projection
inferred← citeshttps://doi.org/10.1137/s0895480104440985openalex-snapshot
0, 1/2‐Cuts and the Linear Ordering Problem: Surfaces That Define Facets
inferred← citeshttps://doi.org/10.1137/s0895480196300145openalex-snapshot
New Facets of the Linear Ordering Polytope
inferred← citeshttps://doi.org/10.1145/1536414.1536455openalex-snapshot
Integrality gaps for Sherali-Adams relaxations
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.11606/t.45.2016.tde-20102016-123243openalex-snapshot
Estratégias de resolução para o problema de job-shop flexível
inferred← citeshttps://doi.org/10.1287/ijoc.1090.0318openalex-snapshot
Exact Algorithms for the Quadratic Linear Ordering Problem
inferred← citeshttps://doi.org/10.1287/moor.2023.1368openalex-snapshot
Approximation Algorithms and Linear Programming Relaxations for Scheduling Problems Related to Min-Sum Set Cover
inferred← citeshttps://doi.org/10.1287/opre.1040.0144openalex-snapshot
Optimal Cyclic Multi-Hoist Scheduling: A Mixed Integer Programming Approach
inferred← citeshttps://doi.org/10.1287/opre.1080.0548openalex-snapshot
An Exact Approach to the One-Dimensional Facility Layout Problem
inferred← citeshttps://doi.org/10.1287/opre.32.6.1195openalex-snapshot
A Cutting Plane Algorithm for the Linear Ordering Problem
inferred← citeshttps://doi.org/10.15476/elte.2018.003openalex-snapshot
Approximation and exact methods for machine scheduling problems with non-renewable resources
inferred← citeshttps://doi.org/10.15807/jorsj.54.142openalex-snapshot
LAGRANGIAN RELAXATION AND PEGGING TEST FOR LINEAR ORDERING PROBLEMS( SCOPE (Seminar on Computation and OPtimization for new Extensions))
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
inferred← citeshttps://doi.org/10.17877/de290r-6716openalex-snapshot
Exact methods for nonlinear combinatorial optimization
inferred← citeshttps://doi.org/10.18255/1818-1015-2016-1-23-40openalex-snapshot
A Special Role of Boolean Quadratic Polytopes among Other Combinatorial Polytopes
inferred← citeshttps://doi.org/10.26481/dis.20150226byopenalex-snapshot
Branch-and-cut algorithms for graph problems
inferred← citeshttps://doi.org/10.3103/s1066369x1208004xopenalex-snapshot
An analog of the cook theorem for polytopes
inferred← citeshttps://doi.org/10.3389/fpsyg.2010.00148openalex-snapshot
Testing Transitivity of Preferences on Two-Alternative Forced Choice Data
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.1102.2460openalex-snapshot
Spectra of Symmetrized Shuffling Operators
inferred← citeshttps://doi.org/10.48550/arxiv.1503.03170openalex-snapshot
Min Morse: Approximability & Applications
inferred← citeshttps://doi.org/10.48550/arxiv.2001.07011openalex-snapshot
Approximation Algorithms and LP Relaxations for Scheduling Problems Related to Min-Sum Set Cover
inferred← citeshttps://doi.org/10.6000/2371-1647.2015.01.02openalex-snapshot
A Unified Framework for Integer Programming Formulation of Graph Matching Problems
inferred← citeshttps://doi.org/10.70675/1a5cc40dz5aeez43ebzb7d3zbe6c57119b0bopenalex-snapshot
Exploring Combinatorial Aspects of the Stop Number Problem
inferred← citeshttps://doi.org/10.70675/22232f00zc154z4403z9ad9zb300629d8110openalex-snapshot
Une approche polyédrale pour le problème du double voyageur de commerce sous contraintes de piles et pour les ordres lexicographiques
inferred← citeshttps://doi.org/10.70675/a844c6e1zb894z428fza558z1aef1107ae0fopenalex-snapshot
Contribution à l'ordonnancement des ateliers de traitement de surface avec deux robots
inferred← citeshttps://doi.org/10.70675/ec68d32bzfc9dz4986z964cz413d06e9337fopenalex-snapshot
Fixed cardinality linear ordering problem, polyhedral studies and solution methods
inferred← citeshttps://doi.org/10.7155/jgaa.00001openalex-snapshot
2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms
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.