Pages that link to "Item:Q3693267"
From MaRDI portal
The following pages link to Roof duality, complementation and persistency in quadratic 0–1 optimization (Q3693267):
Displaying 26 items.
- Persistency of linear programming relaxations for the stable set problem (Q2118136) (← links)
- Locating a discrete subtree of minimum variance on trees: new strategies to tackle a very hard problem (Q2217463) (← links)
- Combinatorial optimization of the discretized multiphase Mumford-Shah functional (Q2254251) (← links)
- Unconstrained 0-1 optimization and Lagrangean relaxation (Q2277361) (← links)
- Efficient global minimization methods for image segmentation models with four regions (Q2353417) (← links)
- A framework for certified Boolean branch-and-bound optimization (Q2429985) (← links)
- MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability (Q2457672) (← links)
- Constrained 0-1 quadratic programming: basic approaches and extensions (Q2467302) (← links)
- Upper bounds and exact algorithms for \(p\)-dispersion problems (Q2496032) (← links)
- An approximate dynamic programming approach to convex quadratic knapsack problems (Q2566930) (← links)
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming (Q2641083) (← links)
- A polyhedral study of lifted multicuts (Q2688466) (← links)
- Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations (Q3539803) (← links)
- Roof duality for polynomial 0–1 optimization (Q3770279) (← links)
- Approximations of pseudo-Boolean functions; applications to game theory (Q4005441) (← links)
- (Q4729611) (← links)
- Persistency of Linear Programming Relaxations for the Stable Set Problem (Q5041757) (← links)
- Introduction to QUBO (Q5050141) (← links)
- Autarkies and Persistencies for QUBO (Q5050145) (← links)
- Mathematical Programming Models and Exact Algorithms (Q5050146) (← links)
- A branch and bound algorithm for the maximum clique problem (Q5905591) (← links)
- Best reduction of the quadratic semi-assignment problem (Q5931788) (← links)
- Persistency in combinatorial optimization problems on matroids (Q5936456) (← links)
- Efficient joint object matching via linear programming (Q6052052) (← links)
- Faster exact solution of sparse maxcut and QUBO problems (Q6095734) (← links)
- Inductive linearization for binary quadratic programs with linear constraints: a computational study (Q6489313) (← links)