Pages that link to "Item:Q1751150"
From MaRDI portal
The following pages link to Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (Q1751150):
Displaying 5 items.
- A maximum edge-weight clique extraction algorithm based on branch-and-bound (Q783045) (← links)
- Domain reduction techniques for global NLP and MINLP optimization (Q1699520) (← links)
- A branch and price algorithm for EOS constellation imaging and downloading integrated scheduling problem (Q1725600) (← links)
- Preprocessing and cut generation techniques for multi-objective binary programming (Q1755381) (← links)
- Computational Short Cuts in Infinite Domain Constraint Satisfaction (Q5870497) (← links)
