The following pages link to (Q3236252):
Displaying 49 items.
- Extended formulation and valid inequalities for the multi-item inventory lot-sizing problem with supplier selection (Q2668663) (← links)
- The bipartite Boolean quadric polytope (Q2673249) (← links)
- Convex polytopes all of whose reverse lexicographic initial ideals are squarefree (Q2716095) (← links)
- Structural search and optimization in social networks (Q2815472) (← links)
- A Polytope for a Product of Real Linear Functions in 0/1 Variables (Q2897309) (← links)
- Compactifications of the Generalized Jacobian Variety (Q3208785) (← links)
- Maximum-Minimum Sätze über Graphen (Q3252412) (← links)
- A matrix criterion for structural balance (Q3266140) (← links)
- Matrices of rational integers (Q3277523) (← links)
- Typical performance of approximation algorithms for NP-hard problems (Q3302475) (← links)
- I-Colorings,I-Phasings, andI-Intersection assignments for graphs, and their applications (Q3309475) (← links)
- Partial Colorings of Unimodular Hypergraphs (Q3503493) (← links)
- Comparing Universal Covers in Polynomial Time (Q3503635) (← links)
- A decomposition property of polyhedra (Q3703640) (← links)
- Structural properties and recognition of restricted and strongly unimodular matrices (Q3783863) (← links)
- The Number of Solutions to Linear Diophantine Equations and Multivariate Splines (Q3801631) (← links)
- On the use of alternating chains and hypergraphs in edge coloring (Q3863911) (← links)
- Connected and alternating vectors: Polyhedra and algorithms (Q3895223) (← links)
- On some characterisations of totally unimodular matrices (Q3895600) (← links)
- Semiantichains and Unichain Coverings in Direct Products of Partial Orders (Q3966188) (← links)
- A constructive method to recognize the total unimodularity of a matrix (Q4093587) (← links)
- On totally unimodular matrices (Q4128925) (← links)
- Unimodular matrices of flow problems with additional constraints (Q4152313) (← links)
- Graphic matroids and the multicommodity transportation problem (Q4154388) (← links)
- Disjoint (<i>s, t</i>)‐cuts in a network (Q4712978) (← links)
- Integral decomposition in polyhedra (Q4740329) (← links)
- Polynomial algorithms for a class of linear programs (Q4749597) (← links)
- Resistant Sets in the Unit Hypercube (Q4991667) (← links)
- Integer Plane Multiflow Maximisation: Flow-Cut Gap and One-Quarter-Approximation (Q5041741) (← links)
- Subdeterminants and Concave Integer Quadratic Programming (Q5206942) (← links)
- Combinatorial Optimization: The Interplay of Graph Theory, Linear and Integer Programming Illustrated on Network Flow (Q5256763) (← links)
- Poincaré-Hopf inequalities (Q5461376) (← links)
- Flots et tensions dans un graphe (Q5569395) (← links)
- Balanced matrices (Q5659570) (← links)
- Über reguläre Kettengruppen (Q5731398) (← links)
- Robust Optimization of Sums of Piecewise Linear Functions with Application to Inventory Problems (Q5740224) (← links)
- 2-Modular Matrices (Q5864215) (← links)
- Trichotomy for the reconfiguration problem of integer linear systems (Q5896129) (← links)
- Extended formulations in combinatorial optimization (Q5900907) (← links)
- Extended formulations in combinatorial optimization (Q5919994) (← links)
- Systems of representatives (Q5920823) (← links)
- Local optimality subsets and global optimization: A prospective approach (Q5937143) (← links)
- Convexity and global optimization: A theoretical link (Q5941512) (← links)
- Perfect, ideal and balanced matrices (Q5943927) (← links)
- Stable matching: An integer programming approach (Q6053647) (← links)
- The enemy of my enemy is my friend: new conditions for network games (Q6088194) (← links)
- On polynomially solvable constrained input selections for fixed and switched linear structured systems (Q6088368) (← links)
- On a variant of Flory model (Q6585267) (← links)
- A network flow approach to a common generalization of Clar and Fries numbers (Q6589122) (← links)
