Pages that link to "Item:Q476314"
From MaRDI portal
The following pages link to Some efficiently solvable problems over integer partition polytopes (Q476314):
Displaying 11 items.
- Extension complexity of formal languages (Q778518) (← links)
- Rectangular partition is polynomial in two dimensions but NP-complete in three (Q808703) (← links)
- Application of regular partitions in integer programming (Q1902798) (← links)
- On the complexity of Hilbert refutations for partition (Q2252121) (← links)
- Feasible partition problem in reverse convex and convex mixed-integer programming (Q2256208) (← links)
- Well-solvable instances for the partition problem (Q2371107) (← links)
- A formulation of the wide partition conjecture using the atom problem in discrete tomography (Q2440106) (← links)
- Combinatorial operations for the generation of vertices of integer partition polytopes (Q2837416) (← links)
- EXACT SOLUTIONS OF RECTANGULAR PARTITIONS VIA INTEGER PROGRAMMING (Q4762911) (← links)
- Number of Vertices of the Polytope of Integer Partitions and Factorization of the Partitioned Number (Q6050732) (← links)
- Optimal Dorfman group testing for symmetric distributions (Q6617267) (← links)