The following pages link to On the acyclic subgraph polytope (Q3698818):
Displaying 50 items.
- On the membership problem for the \({0, 1/2}\)-closure (Q408382) (← links)
- Integer linear programming for the Bayesian network structure learning problem (Q511785) (← links)
- Median linear orders: Heuristics and a branch and bound algorithm (Q582183) (← links)
- Exact localisations of feedback sets (Q722200) (← links)
- On cutting-plane proofs in combinatorial optimization (Q1123134) (← links)
- Facets and lifting procedures for the set covering polytope (Q1123808) (← links)
- Computational results of an interior point algorithm for large scale linear programming (Q1181915) (← links)
- Generalizing the concept of binary choice systems induced by rankings: One way of probabilizing deterministic measurement structures (Q1184360) (← links)
- Geometric and combinatorial properties of the polytope of binary choice probabilities (Q1184363) (← links)
- On a composition of independence systems by circuit identification (Q1186136) (← links)
- A graph-theoretic heuristic for designing loop-layout manufacturing systems (Q1197695) (← links)
- Optimal facility layout design (Q1306388) (← links)
- More facets from fences for linear ordering and acyclic subgraph polytopes (Q1326756) (← links)
- Approximations for the maximum acyclic subgraph problem (Q1332750) (← links)
- Polyhedral structure and properties of a model for layout design (Q1333453) (← links)
- On approximability of linear ordering and related NP-optimization problems on graphs. (Q1427183) (← links)
- Signed orders, choice probabilities, and linear polytopes (Q1598972) (← links)
- Least cost influence propagation in (social) networks (Q1650779) (← links)
- Arc-based integer programming formulations for three variants of proportional symbol maps (Q1751132) (← links)
- \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts (Q1814791) (← links)
- A new heuristic algorithm solving the linear ordering problem (Q1816404) (← links)
- Workload balancing and loop layout in the design of a flexible manufacturing system (Q1840856) (← links)
- The reversing number of a digraph (Q1894351) (← links)
- On the partial order polytope of a digraph (Q1915807) (← links)
- On subdivision posets of cyclic polytopes (Q1964650) (← links)
- On the linear ordering problem and the rankability of data (Q2072628) (← links)
- Computing in combinatorial optimization (Q2075761) (← links)
- A polyhedral approach to least cost influence maximization in social networks (Q2111478) (← links)
- On computing the path number of a graph (Q2132346) (← links)
- A branch-and-bound algorithm for the linear ordering problem with cumulative costs (Q2426525) (← links)
- The linear ordering problem with cumulative costs (Q2482806) (← links)
- Multiprocessor scheduling under precedence constraints: polyhedral results (Q2489902) (← links)
- Facets of the linear ordering polytope: a unification for the fence family through weighted graphs (Q2497757) (← links)
- How to recycle your facets (Q2506820) (← links)
- A survey on the linear ordering problem for weighted or unweighted tournaments (Q2644372) (← links)
- On the hardness of approximating some NP-optimization problems related to minimum linear ordering problem (Q2773025) (← links)
- Facet Generating Techniques (Q2971603) (← links)
- A branch-and-cut algorithm for a resource-constrained scheduling problem (Q3004200) (← links)
- The Complexity of Acyclic Subhypergraph Problems (Q3078379) (← links)
- Acyclic Orientations with Path Constraints (Q3163668) (← links)
- Computing Optimal Discrete Morse Functions (Q3439152) (← links)
- Facets of the linear ordering polytope (Q3698819) (← links)
- (Q4637014) (← links)
- The strongest facets of the acyclic subgraph polytope are unknown (Q4645939) (← links)
- Transitive packing (Q4645940) (← links)
- A polyhedral approach to the feedback vertex set problem (Q4645941) (← links)
- Tight Localizations of Feedback Sets (Q5102049) (← links)
- An Exact Method for the Minimum Feedback Arc Set Problem (Q5102057) (← links)
- Combinatorial acyclicity models for potential‐based flows (Q6065854) (← links)
- A branch‐and‐cut approach for the least cost influence problem on social networks (Q6092651) (← links)
