Pages that link to "Item:Q1198737"
From MaRDI portal
The following pages link to A polynomial algorithm for an integer quadratic non-separable transportation problem (Q1198737):
Displayed 10 items.
- Using quadratic programming to solve high multiplicity scheduling problems on parallel machines (Q675305) (← links)
- A binary integer program to maximize the agreement between partitions (Q734372) (← links)
- Exact and approximate algorithms for high-multiplicity parallel machine scheduling (Q1041349) (← links)
- On polynomial solvability of the high multiplicity total weighted tardiness problem (Q1208472) (← links)
- Discrete convex analysis (Q1290668) (← links)
- Quadratic M-convex and L-convex functions (Q1883382) (← links)
- A unified approach to polynomially solvable cases of integer ``non-separable'' quadratic optimization (Q1897348) (← links)
- Complexity and algorithms for nonlinear optimization problems (Q2480263) (← links)
- A framework for the complexity of high-multiplicity scheduling problems (Q2569171) (← links)
- Multiplicity and complexity issues in contemporary production scheduling (Q5422015) (← links)