The following pages link to (Q5722271):
Displaying 50 items.
- On total unimodularity of edge-edge adjacency matrices (Q378224) (← links)
- Relaxations for two-level multi-item lot-sizing problems (Q403668) (← links)
- Semidefinite optimization in discrepancy theory (Q715251) (← links)
- Packing and covering of crossing families of cuts (Q789399) (← links)
- A characterization of unimodular orientations of simple graphs (Q921013) (← links)
- Red-blue covering problems and the consecutive ones property (Q1018089) (← links)
- Rooted \(k\)-connections in digraphs (Q1025990) (← links)
- On the representability of totally unimodular matrices on bidirected graphs (Q1044979) (← links)
- Some sequences associated with combinatorial structures (Q1073032) (← links)
- Polyhedral proof methods in combinatorial optimization (Q1082268) (← links)
- Discrepancy of set-systems and matrices (Q1084393) (← links)
- Totally balanced and totally unimodular matrices defined by center location problems (Q1104945) (← links)
- Total unimodularity and the Euler-subgraph problem (Q1107442) (← links)
- Directed submodularity, ditroids and directed submodular flows (Q1116891) (← links)
- Complement total unimodularity (Q1143465) (← links)
- Chromatic optimisation: Limitations, objectives, uses, references (Q1162931) (← links)
- A decomposition of strongly unimodular matrices into incidence matrices of digraphs (Q1193711) (← links)
- A decomposition theory for matroids. VII: Analysis of minimal violation matrices (Q1204474) (← links)
- Customized multi-period stochastic assignment problem for social engagement and opportunistic IoT (Q1652577) (← links)
- Staircase compatibility and its applications in scheduling and piecewise linearization (Q1662653) (← links)
- Totally unimodular multistage stochastic programs (Q1785317) (← links)
- On some polytopes contained in the 0,1 hypercube that have a small Chvátal rank (Q1801017) (← links)
- Minimizing the number of apertures in multileaf collimator sequencing with field splitting (Q1801051) (← links)
- Forbidden configurations, discrepancy and determinants (Q1813625) (← links)
- Optimisation and hypergraph theory (Q1813951) (← links)
- Balanced \(0,\pm 1\) matrices. I: Decomposition (Q1850525) (← links)
- Balanced \(0,\pm 1\)-matrices, bicoloring and total dual integrality (Q1919803) (← links)
- Implementation of a unimodularity test (Q1947200) (← links)
- Totally unimodular stochastic programs (Q1949257) (← links)
- On pseudomatroid property of matrices (Q1970490) (← links)
- Convex hull results for generalizations of the constant capacity single node flow set (Q2020609) (← links)
- Box-total dual integrality, box-integrality, and equimodular matrices (Q2039243) (← links)
- The integrality number of an integer program (Q2118127) (← links)
- Exploiting complete linear descriptions for decentralized power market problems with integralities (Q2155382) (← links)
- Recoverable robust representatives selection problems with discrete budgeted uncertainty (Q2158008) (← links)
- Decision support for strategic energy planning: a robust optimization framework (Q2273910) (← links)
- Graph coloring inequalities from all-different systems (Q2342600) (← links)
- Constrained minimum-\(k\)-star clustering and its application to the consolidation of farmland (Q2359522) (← links)
- Dioïds and semirings: Links to fuzzy sets and other applications (Q2372262) (← links)
- Recent progress on combinatorics and algorithms for low discrepancy roundings (Q2373430) (← links)
- Robust recoverable and two-stage selection problems (Q2410249) (← links)
- An integral LP relaxation for a drayage problem (Q2419362) (← links)
- Balanced matrices (Q2433704) (← links)
- Good and nice colorings of balanced hypergraphs (Q2433719) (← links)
- Fixed-charge transportation on a path: optimization, LP formulations and separation (Q2434997) (← links)
- Optimal mechanism design for the private supply of a public good (Q2435905) (← links)
- Colorings of \(k\)-balanced matrices and integer decomposition property of related polyhedra (Q2467476) (← links)
- Linear time algorithms for generalized edge dominating set problems (Q2480902) (← links)
- An accelerated Benders decomposition algorithm for solving a double-type double-standard maximal covering location problem (Q2661956) (← links)
- A compact reformulation of the two-stage robust resource-constrained project scheduling problem (Q2668660) (← links)
