The following pages link to (Q3236253):
Displaying 48 items.
- Mathematical programming approaches for classes of random network problems (Q319592) (← links)
- A heuristic based on negative chordless cycles for the maximum balanced induced subgraph problem (Q342319) (← links)
- On linear programming duality and Landau's characterization of tournament (Q399504) (← links)
- Permutation betting markets: singleton betting with extra information (Q547299) (← links)
- On a class of mixed-integer sets with a single integer variable (Q614040) (← links)
- Models and methods for standardization problems (Q704119) (← links)
- Lineare Programme und allgemeine Vertretersysteme (Q774107) (← links)
- Subspaces with well-scaled frames (Q1122483) (← links)
- Complement total unimodularity (Q1143465) (← links)
- Discrete extremal problems (Q1152306) (← links)
- Signed graphs (Q1160198) (← links)
- A decomposition of strongly unimodular matrices into incidence matrices of digraphs (Q1193711) (← links)
- A characterization of the uncapacitated network design polytope (Q1200785) (← links)
- A proof of Fulkerson's characterization of permutation matrices (Q1221117) (← links)
- Some combinatorial properties of centrosymmetric matrices (Q1234335) (← links)
- Rational and integral \(k\)-regular matrices. (Q1420582) (← links)
- Extracting pure network submatrices in linear programs using signed graphs. (Q1427813) (← links)
- Boolean constraint satisfaction: Complexity results for optimization problems with arbitrary weights (Q1575713) (← links)
- On matrices with the Edmonds-Johnson property arising from bidirected graphs (Q1745732) (← links)
- Locally orderless tracking (Q1799931) (← links)
- The simple plant location problem: Survey and synthesis (Q1837098) (← links)
- Minimizing maximum indegree (Q1887077) (← links)
- Balanced \(0,\pm 1\)-matrices, bicoloring and total dual integrality (Q1919803) (← links)
- Housing market short-term equilibriums maximizing linear utility functions (Q1961961) (← links)
- Box-total dual integrality, box-integrality, and equimodular matrices (Q2039243) (← links)
- Nullstellensatz size-degree trade-offs from reversible pebbling (Q2040600) (← links)
- On the \(k\)-strong Roman domination problem (Q2197424) (← links)
- Robust strategic planning for mobile medical units with steerable and unsteerable demands (Q2239842) (← links)
- Time-slot assignment for TDMA-systems (Q2265947) (← links)
- Assignment problems with changeover cost (Q2267319) (← links)
- Maximum margin partial label learning (Q2398093) (← links)
- Double ramification cycles on the moduli spaces of curves (Q2400807) (← links)
- Balanced matrices (Q2433704) (← links)
- A polynomial case of the parsimony haplotyping problem (Q2494824) (← links)
- Inside-out polytopes (Q2503362) (← links)
- Extremal configurations and decomposition theorems. I (Q2528386) (← links)
- Compactifications of the Generalized Jacobian Variety (Q3208785) (← links)
- Cost-Sharing Models in Participatory Sensing (Q3449580) (← links)
- A constructive method to recognize the total unimodularity of a matrix (Q4093587) (← links)
- Graphic matroids and the multicommodity transportation problem (Q4154388) (← links)
- Polynomial Time Reachability Analysis in Discrete State Chemical Reaction Networks Obeying Conservation Laws (Q5050755) (← links)
- A Note on Appointment Scheduling with Piecewise Linear Cost Functions (Q5247619) (← links)
- Flots et tensions dans un graphe (Q5569395) (← links)
- Extended formulations in combinatorial optimization (Q5900907) (← links)
- Extended formulations in combinatorial optimization (Q5919994) (← links)
- Systems of representatives (Q5920823) (← links)
- The knapsack problem with forfeit sets (Q6109304) (← links)
- On unimodular graphs with a unique perfect matching (Q6153471) (← links)
