The following pages link to PORTA (Q17024):
Displaying 50 items.
- The single-item lot-sizing polytope with continuous start-up costs and uniform production capacity (Q256627) (← links)
- Single-commodity robust network design with finite and hose demand sets (Q291071) (← links)
- Bayes factors for state-trace analysis (Q296937) (← links)
- On the polyhedral structure of uniform cut polytopes (Q401136) (← links)
- A benchmark library and a comparison of heuristic methods for the linear ordering problem (Q429522) (← links)
- Strong and compact relaxations in the original space using a compact extended formulation (Q458127) (← links)
- Modeling disjunctive constraints with a logarithmic number of binary variables and constraints (Q543399) (← links)
- On the separation of disjunctive cuts (Q543404) (← links)
- The linear ordering problem. Exact and heuristic methods in combinatorial optimization. (Q612873) (← links)
- Small bipartite subgraph polytopes (Q613319) (← links)
- Algebraic methods for parameterized codes and invariants of vanishing ideals over finite fields (Q620935) (← links)
- Combinatorial integral approximation (Q634784) (← links)
- PALP: a package for analysing lattice polytopes with applications to toric geometry (Q709469) (← links)
- Primary facets of order polytopes (Q730181) (← links)
- Vertex adjacencies in the set covering polyhedron (Q730484) (← links)
- The stable set polytope of claw-free graphs with stability number at least four. II. Striped graphs are \(\mathcal{G}\)-perfect (Q740644) (← links)
- Finiteness of relative equilibria of the four-body problem (Q818632) (← links)
- MIP reformulations of the probabilistic set covering problem (Q847820) (← links)
- Lifting inequalities: a framework for generating strong cuts for nonlinear programs (Q847822) (← links)
- The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm (Q847836) (← links)
- Optimizing over the first Chvátal closure (Q877190) (← links)
- Individual differences in the algebraic structure of preferences (Q894103) (← links)
- The stable set polytope of icosahedral graphs (Q898118) (← links)
- PANDA: a software for polyhedral transformations (Q904954) (← links)
- Convex hulls of superincreasing knapsacks and lexicographic orderings (Q908302) (← links)
- Intermediate integer programming representations using value disjunctions (Q951104) (← links)
- Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution (Q967369) (← links)
- An updated survey on the linear ordering problem for weighted or unweighted tournaments (Q970187) (← links)
- On packing and covering polyhedra of consecutive ones circulant clutters (Q987683) (← links)
- An approval-voting polytope for linear orders (Q1368384) (← links)
- Canonical modules of certain edge subrings (Q1399683) (← links)
- Facets of linear signed order polytopes. (Q1414239) (← links)
- Weak order polytopes. (Q1420590) (← links)
- Some facets of the polytope of even permutation matrices. (Q1430383) (← links)
- Quasi-semi-metrics, oriented multi-cuts and related polyhedra (Q1582485) (← links)
- Formulating logical implications in combinatorial optimisation (Q1598766) (← links)
- Complete formulations of polytopes related to extensions of assignment matrices (Q1662654) (← links)
- Limited memory rank-1 cuts for vehicle routing problems (Q1728212) (← links)
- Extended formulations for order polytopes through network flows (Q1736010) (← links)
- A two-level graph partitioning problem arising in mobile wireless communications (Q1744904) (← links)
- The hypermetric cone and polytope on eight vertices and some generalizations (Q1745770) (← links)
- Multi-commodity variable upper bound flow models (Q1751124) (← links)
- Valid inequalities for a single constrained 0-1 MIP set intersected with a conflict graph (Q1751163) (← links)
- Integer programming approach to static monopolies in graphs (Q1752610) (← links)
- Identification of unidentified equality constraints for integer programming problems (Q1753456) (← links)
- Valid inequalities for two-period relaxations of big-bucket lot-sizing problems: zero setup case (Q1754210) (← links)
- Interior point methods in DEA to determine non-zero multiplier weights (Q1762028) (← links)
- The biorder polytope (Q1765958) (← links)
- Projections of polytopes and the generalized Baues conjecture (Q1816413) (← links)
- On the combinatorial structure of the approval-voting polytope (Q1867363) (← links)
