Pages that link to "Item:Q1100098"
From MaRDI portal
The following pages link to Some branch and bound techniques for nonlinear optimization (Q1100098):
Displaying 8 items.
- Polynomial-time approximation algorithms for anchor-free TDoA localization (Q742410) (← links)
- Branch and bound with estimation based on pseudo-shadow-prices (Q805497) (← links)
- Solving integer programs with a few important binary gub constraints (Q1309895) (← links)
- A nested layered network model for parallel solutions of discrete SPPs (Q1356859) (← links)
- A new approach to stochastic programming problems: Discrete model (Q1388844) (← links)
- Integrated supply chain scheduling of procurement, production, and distribution under spillover effects (Q2026962) (← links)
- Minimum concave-cost network flow problems: Applications, complexity, and algorithms (Q2277131) (← links)
- A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems (Q2503087) (← links)
