Pages that link to "Item:Q1762145"
From MaRDI portal
The following pages link to Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem (Q1762145):
Displaying 13 items.
- 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)
- Multiple graph regularized nonnegative matrix factorization (Q888579) (← links)
- Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming (Q1742902) (← links)
- Parametric Lagrangian dual for the binary quadratic programming problem (Q2018469) (← links)
- Improved row-by-row method for binary quadratic optimization problems (Q2327692) (← links)
- Closed-form formulas for evaluating \(r\)-flip moves to the unconstrained binary quadratic programming problem (Q2333129) (← 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)
- Lower bound improvement and forcing rule for quadratic binary programming (Q2506180) (← links)
- Lagrangean decompositions for the unconstrained binary quadratic programming problem (Q3087848) (← links)
- Mathematical Programming Models and Exact Algorithms (Q5050146) (← links)
