Pages that link to "Item:Q757251"
From MaRDI portal
The following pages link to Using branch-and-bound to solve bi-level geometric programming problems: A new optimization model (Q757251):
Displaying 4 items.
- A new two-level linear relaxed bound method for geometric programming problems (Q1774846) (← links)
- An update on bi-level geometric programming: A new optimization model (Q1801971) (← links)
- Implementation techniques for geometric branch-and-bound matching methods (Q4419487) (← links)
- Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography (Q5014642) (← links)