The following pages link to (Q3858023):
Displaying 14 items.
- Vertex adjacencies in the set covering polyhedron (Q730484) (← links)
- On separation and adjacency problems for perfectly matchable subgraph polytopes of a graph (Q911485) (← links)
- Characterizations of adjacency on the branching polyhedron (Q1139604) (← links)
- Hamiltonicity and combinatorial polyhedra (Q1147161) (← links)
- Adjacent vertices on the b-matching polyhedron (Q1156817) (← links)
- The median procedure in cluster analysis and social choice theory (Q1164937) (← links)
- Paths on polymatroids (Q1196722) (← links)
- Adjacency on the constrained assignment problem (Q1270787) (← links)
- Adjacency of the best and second best valued solutions in combinatorial optimization problems (Q1314336) (← links)
- Ideal polytopes and face structures of some combinatorial optimization problems (Q1924055) (← links)
- Some Problems on Approximate Counting in Graphs and Matroids (Q2971623) (← links)
- Adjacency on polymatroids (Q3335528) (← links)
- Traversing combinatorial 0/1-polytopes via optimization (Q6602241) (← links)
- Finding a second Hamiltonian decomposition of a 4-regular multigraph by integer linear programming (Q6645186) (← links)