Pages that link to "Item:Q4136929"
From MaRDI portal
The following pages link to On the integer-valued variables in the linear vertex packing problem (Q4136929):
Displaying 14 items.
- Pseudo-Boolean optimization (Q697569) (← links)
- A network approach for specially structured linear programs arising in 0-1 quadratic optimization (Q943852) (← links)
- Random near-regular graphs and the node packing problem (Q1065829) (← links)
- The maximum clique problem (Q1318271) (← links)
- König-Egerváry graphs, 2-bicritical graphs and fractional matchings (Q1825210) (← links)
- Pseudo-Hamiltonian-connected graphs (Q1971217) (← links)
- Persistency of linear programming relaxations for the stable set problem (Q2118136) (← links)
- New results relating independence and matchings (Q2151222) (← links)
- Tractability of König edge deletion problems (Q2333799) (← links)
- Crown reductions for the minimum weighted vertex cover problem (Q2473030) (← links)
- A polyhedral study of the generalized vertex packing problem (Q2492699) (← links)
- Minimum node covers and 2-bicritical graphs (Q3050138) (← links)
- Estimating the Size of Branch-and-Bound Trees (Q5085999) (← links)
- A theoretical and computational analysis of full strong-branching (Q6126652) (← links)
