Pages that link to "Item:Q3087848"
From MaRDI portal
The following pages link to Lagrangean decompositions for the unconstrained binary quadratic programming problem (Q3087848):
Displaying 10 items.
- Optimization procedures for the bipartite unconstrained 0-1 quadratic programming problem (Q337120) (← links)
- The unconstrained binary quadratic programming problem: a survey (Q405668) (← links)
- A column generation approach for the unconstrained binary quadratic programming problem (Q439327) (← links)
- A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs (Q683935) (← links)
- Analyzing quadratic unconstrained binary optimization problems via multicommodity flows (Q967446) (← links)
- Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem (Q1762145) (← links)
- Parametric Lagrangian dual for the binary quadratic programming problem (Q2018469) (← links)
- Building an iterative heuristic solver for a quantum annealer (Q2374373) (← links)
- Improved mathematical model and bounds for the crop rotation scheduling problem with adjacency constraints (Q2424771) (← links)
- Lagrangean decomposition: A model yielding stronger lagrangean bounds (Q3780005) (← links)