Pages that link to "Item:Q1837108"
From MaRDI portal
The following pages link to Some NP-complete problems in linear programming (Q1837108):
Displaying 12 items.
- Nonlinear bipartite matching (Q924630) (← links)
- Sign-solvable linear complementarity problems (Q929486) (← links)
- Degeneracy in transportation problems (Q1082263) (← links)
- Adjacency on the constrained assignment problem (Q1270787) (← links)
- Combinatoric classes of the transportation problem and their properties (Q1312755) (← links)
- Matchings in colored bipartite networks (Q1613406) (← links)
- On the \(\epsilon\)-perturbation method for avoiding degeneracy (Q1824546) (← links)
- Mathematical systems for enhancing diffuse images of point sources (Q1915959) (← links)
- Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron. (Q2482881) (← links)
- Bicolored matchings in some classes of graphs (Q5899324) (← links)
- Revisiting degeneracy, strict feasibility, stability, in linear programming (Q6113350) (← links)
- Eigenpolytope Universality and Graphical Designs (Q6195955) (← links)