Pages that link to "Item:Q1197889"
From MaRDI portal
The following pages link to Complexity of uniqueness and local search in quadratic 0-1 programming (Q1197889):
Displaying 28 items.
- The unconstrained binary quadratic programming problem: a survey (Q405668) (← links)
- A column generation approach for the unconstrained binary quadratic programming problem (Q439327) (← links)
- Extremal values of global tolerances in combinatorial optimization with an additive objective function (Q453633) (← links)
- Solving unconstrained binary quadratic programming problem by global equilibrium search (Q464982) (← links)
- A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs (Q683935) (← links)
- Deciding uniqueness in norm maximazation (Q687086) (← links)
- A new linearization technique for multi-quadratic 0-1 programming problems. (Q703274) (← links)
- Analyzing the complexity of finding good neighborhood functions for local search algorithms (Q857808) (← links)
- Stability analysis in discrete optimization involving generalized addition operations (Q896189) (← links)
- QUAD01: A data-structured implementation of Hansen's quadratic zero-one programming algorithm (Q1278400) (← links)
- On the complexity of approximating a KKT point of quadratic programming (Q1380927) (← links)
- Globally solving quadratic programs with convex objective and complementarity constraints via completely positive programming (Q1716972) (← links)
- On complexity of unconstrained hyperbolic 0--1 programming problems (Q1779713) (← links)
- A heuristic-based branch and bound algorithm for unconstrained quadratic zero-one programming (Q1893147) (← links)
- Exact solution approach for a class of nonlinear bilevel knapsack problems (Q2018478) (← links)
- Uniqueness in quadratic and hyperbolic \(0-1\) programming problems (Q2450746) (← links)
- Lower bound improvement and forcing rule for quadratic binary programming (Q2506180) (← links)
- Computational comparison studies of quadratic assignment like formulations for the in silico sequence selection problem in De Novo protein design (Q2576440) (← links)
- On equivalent reformulations for absolute value equations (Q2655401) (← links)
- A QUBO formulation for the tree containment problem (Q2699952) (← links)
- Optimality Conditions for the Minimization of Quadratic 0-1 Problems (Q2945127) (← links)
- An Ellipsoidal Bounding Scheme for the Quasi-Clique Number of a Graph (Q3386796) (← links)
- LINEARIZATION OF 0-1 MULTI-QUADRATIC FRACTIONAL PROGRAMMING PROBLEM (Q3632032) (← links)
- Testing optimality for quadratic 0?1 unconstrained problems (Q4859451) (← links)
- Global equilibrium search applied to the unconstrained binary quadratic optimization problem (Q5459821) (← links)
- Adaptive randomization in network data (Q6200871) (← links)
- A quadratic simplex algorithm for primal optimization over zero-one polytopes (Q6202952) (← links)
- New approach to solve unconstrained binary quadratic problem (Q6658442) (← links)
