Pages that link to "Item:Q5679925"
From MaRDI portal
The following pages link to A Graph-Theoretic Equivalence for Integer Programs (Q5679925):
Displaying 10 items.
- Unconstrained quadratic bivalent programming problem (Q792219) (← links)
- Balancing signed graphs (Q1156154) (← links)
- A constrained nonlinear 0-1 program for data allocation (Q1290718) (← links)
- The generalized vertex cover problem and some variations (Q1756348) (← links)
- Strong lower bounds for the prize collecting Steiner problem in graphs (Q1827870) (← links)
- A unified approach to polynomially solvable cases of integer ``non-separable'' quadratic optimization (Q1897348) (← links)
- An exact approach for cyclic inbound inventory routing in a level production system (Q2294631) (← links)
- A new modeling and solution approach for the set-partitioning problem (Q2456638) (← links)
- An improved formulation for the inventory routing problem with time-varying demands (Q2672144) (← links)
- 0-1 Quadratic programming approach for optimum solutions of two scheduling problems (Q4286574) (← links)
