The following pages link to (Q4529638):
Displaying 17 items.
- An integrative cooperative search framework for multi-decision-attribute combinatorial optimization: application to the MDPVRP (Q319782) (← links)
- Methods of optimization and systems analysis for problems of transcomputational complexity. (Q424645) (← links)
- Lagrangian heuristic for a class of the generalized assignment problems (Q611434) (← links)
- A Lagrangian bound for many-to-many assignment problems (Q975754) (← links)
- A mathematical model for estimating the potential margin of state undecided voters for a candidate in a US federal election (Q1029173) (← links)
- Improved Lagrangian bounds and heuristics for the generalized assignment problem (Q1745880) (← links)
- Studying properties of Lagrangian bounds for many-to-many assignment problems (Q2017507) (← links)
- Upper and lower bounds for the sales force deployment problem with explicit contiguity constraints (Q2253998) (← links)
- Calculating the best dual bound for problems with multiple Lagrangian relaxations (Q2391512) (← links)
- Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem (Q2433806) (← links)
- (Q3218038) (← links)
- Open-Pit Mining with Uncertainty: A Conditional Value-at-Risk Approach (Q4596157) (← links)
- Optimization of large-scale complex systems (Q4723614) (← links)
- (Q5389652) (← links)
- (Q5389886) (← links)
- Linear optimization over homogeneous matrix cones (Q6047504) (← links)
- Robust maximum flow network interdiction considering uncertainties in arc capacity and resource consumption (Q6547016) (← links)
