Pages that link to "Item:Q598999"
From MaRDI portal
The following pages link to Total dual integrality and integer polyhedra (Q598999):
Displaying 44 items.
- Recognizing conic TDI systems is hard (Q543398) (← links)
- The combinatorics of modeling and analyzing biological systems (Q553904) (← links)
- Total dual integrality and integer polyhedra (Q598999) (← links)
- Non-standard approaches to integer programming (Q697562) (← links)
- On a class of languages with holonomic generating functions (Q728269) (← links)
- Integral infeasibility and testing total dual integrality (Q757248) (← links)
- Recent trends in combinatorial optimization (Q788638) (← links)
- A note on matchings and separability (Q802467) (← links)
- Path-closed sets (Q802569) (← links)
- On Hilbert bases of cuts (Q898132) (← links)
- The power of pyramid decomposition in Normaliz (Q898277) (← links)
- An integer analogue of Carathéodory's theorem (Q1074117) (← links)
- On total dual integrality (Q1159081) (← links)
- Total dual integrality and b-matchings (Q1167664) (← links)
- Test sets of integer programs (Q1298753) (← links)
- Coins and cones (Q1356015) (← links)
- On the properties of the subsets of a discrete domain defined by the local optimae of a function endowed with some geometrical properties (Q1584455) (← links)
- Measuring with jugs (Q1603714) (← links)
- Total dual integrality and integral solutions of the linear complementarity problem (Q1790478) (← links)
- Gainfree Leontief substitution flow problems (Q1802953) (← links)
- Operations that preserve total dual integrality (Q1837522) (← links)
- Strong connectivity of polyhedral complexes (Q1915156) (← links)
- Hilbert bases of cuts (Q1916115) (← links)
- Tessellation and \(g\)-tessellation of circulants, \(Q_ 6\), and \(Q_ 6^ t\) (Q1923196) (← links)
- The minimal Hilbert basis of the Hammond order cone (Q2099316) (← links)
- Total dual dyadicness and dyadic generating sets (Q2164668) (← links)
- The structure of an integral monoid and integer programming feasibility (Q2277141) (← links)
- Duality in mathematics and linear and integer programming (Q2565013) (← links)
- Box-total dual integrality and edge-connectivity (Q2689821) (← links)
- Computational aspects of column generation for nonlinear and conic optimization: classical and linearized schemes (Q2696926) (← links)
- A Minimal Totally Dual Integral Defining System for the <i>b</i>-Matching Polyhedron (Q3669184) (← links)
- On box totally dual integral polyhedra (Q3717741) (← links)
- Polyhedral Combinatorics in Combinatorial Optimization (Q3763906) (← links)
- Total dual integrality implies local strong unimodularity (Q3771976) (← links)
- Sensitivity theorems in integer linear programming (Q3793940) (← links)
- Polyhedral techniques in combinatorial optimization I: Theory (Q4715790) (← links)
- Minimal solutions of linear diophantine systems : bounds and algorithms (Q5055757) (← links)
- The Hilbert basis of the cut cone over the complete graph K 6 (Q5101420) (← links)
- A Notion of Total Dual Integrality for Convex, Semidefinite, and Extended Formulations (Q5216778) (← links)
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg (Q5241224) (← links)
- Local optimality subsets and global optimization: A prospective approach (Q5937143) (← links)
- Convexity and global optimization: A theoretical link (Q5941512) (← links)
- Min–max optimization of node‐targeted attacks in service networks (Q6196869) (← links)
- A quadratic simplex algorithm for primal optimization over zero-one polytopes (Q6202952) (← links)
