Pages that link to "Item:Q5926336"
From MaRDI portal
The following pages link to A generalized assignment problem with special ordered sets: a polyhedral approach. (Q5926336):
Displayed 14 items.
- The piecewise linear optimization polytope: new inequalities and intersection with semi-continuous constraints (Q378090) (← links)
- Polylithic modeling and solution approaches using algebraic modeling systems (Q691438) (← links)
- An LP-based heuristic procedure for the generalized assignment problem with special ordered sets (Q868998) (← links)
- Continuous piecewise linear delta-approximations for univariate functions: computing minimal breakpoint systems (Q896176) (← links)
- A special ordered set approach for optimizing a discontinuous separable piecewise linear function (Q935235) (← links)
- A hybrid tabu search/branch \& bound approach to solving the generalized assignment problem (Q992649) (← links)
- Models for representing piecewise linear cost functions (Q1433660) (← links)
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (Q1751150) (← links)
- Branch-and-cut for separable piecewise linear optimization and intersection with semi-continuous constraints (Q1947201) (← links)
- A polyhedral study of the semi-continuous knapsack problem (Q2434996) (← links)
- An ejection chain approach for the generalized assignment problem (Q2573015) (← links)
- Mixed integer models for the stationary case of gas network optimization (Q2583142) (← links)
- Optimization-Based Very Large-Scale Neighborhood Search for Generalized Assignment Problems with Location/Allocation Considerations (Q2830959) (← links)
- A family of inequalities for the generalized assignment polytope (Q5949919) (← links)
