The following pages link to (Q3236252):
Displaying 50 items.
- The generalized assignment problem with minimum quantities (Q257215) (← links)
- A heuristic based on negative chordless cycles for the maximum balanced induced subgraph problem (Q342319) (← links)
- Satisfiability checking in Łukasiewicz logic as finite constraint satisfaction (Q352963) (← links)
- Testing additive integrality gaps (Q378120) (← links)
- On total unimodularity of edge-edge adjacency matrices (Q378224) (← links)
- On linear programming duality and Landau's characterization of tournament (Q399504) (← links)
- Some efficiently solvable problems over integer partition polytopes (Q476314) (← links)
- A Petri net based approach for multi-robot path planning (Q481351) (← links)
- A min-max relation for stable sets in graphs with no odd-\(K_ 4\) (Q582302) (← links)
- Integer matrices with constraints on leading partial row and column sums (Q602764) (← links)
- \(N\)-fold integer programming and nonlinear multi-transshipment (Q628649) (← links)
- \(k\)-integrality, an extension of total unimodularity (Q688932) (← links)
- Integral rigid sets and periods of nonexpansive maps (Q698650) (← links)
- A min-max relation for the partial q-colourings of a graph. II: Box perfection (Q752726) (← links)
- A system of linear inequalities with a submodular function on \(\{0,\pm 1\}\) vectors (Q761525) (← links)
- Lineare Programme und allgemeine Vertretersysteme (Q774107) (← links)
- Recent trends in combinatorial optimization (Q788638) (← links)
- Packing and covering of crossing families of cuts (Q789399) (← links)
- New polynomial-time algorithms for Camion bases (Q856883) (← links)
- Unimodularity of the Clar number problem (Q861006) (← links)
- \(L_{p}\) linear discrepancy of totally unimodular matrices (Q861031) (← links)
- Breast cancer prediction using the isotonic separation technique (Q877069) (← links)
- Decomposing random mechanisms (Q898659) (← links)
- Trichotomy for integer linear systems based on their sign patterns (Q906434) (← links)
- Compact formulations as a union of polyhedra (Q927156) (← links)
- A min-max theorem for plane bipartite graphs (Q968154) (← links)
- Comparing universal covers in polynomial time (Q987372) (← links)
- Red-blue covering problems and the consecutive ones property (Q1018089) (← links)
- Some sequences associated with combinatorial structures (Q1073032) (← links)
- Unimodular functions (Q1079493) (← links)
- Polyhedral proof methods in combinatorial optimization (Q1082268) (← links)
- The existence and computation of competitive equilibria in markets with an indivisible commodity (Q1083355) (← links)
- Discrepancy of set-systems and matrices (Q1084393) (← links)
- On the integer properties of scheduling set partitioning models (Q1100095) (← links)
- Recognizing max-flow min-cut path matrices (Q1103514) (← links)
- Strong unimodularity for matrices and hypergraphs (Q1104339) (← links)
- Optimal representations of partially ordered sets and a limit Sperner theorem (Q1106225) (← links)
- Total unimodularity and the Euler-subgraph problem (Q1107442) (← links)
- The incidence structure of subspaces with well-scaled frames (Q1110520) (← links)
- Short circuit covers for regular matroids with a nowhere zero 5-flow (Q1112053) (← links)
- Subspaces with well-scaled frames (Q1122483) (← links)
- Relevance of network theory to models of distributed/parallel processing (Q1138905) (← links)
- Complement total unimodularity (Q1143465) (← links)
- Total unimodularity and combinatorial theorems (Q1144100) (← links)
- A separable integer programming problem equivalent to its continual version (Q1152307) (← links)
- Chromatic optimisation: Limitations, objectives, uses, references (Q1162931) (← links)
- On the enumeration of chains in regular chain-groups (Q1164635) (← links)
- Cores of partitioning games (Q1168899) (← links)
- Total unimodularity applications in bi-objective discrete optimization (Q1198627) (← links)
- Matching theory -- a sampler: From Dénes König to the present (Q1198643) (← links)
