Pages that link to "Item:Q3887228"
From MaRDI portal
The following pages link to An Implicit Enumeration Algorithm for Quadratic Integer Programming (Q3887228):
Displaying 40 items.
- Probabilistic GRASP-tabu search algorithms for the UBQP problem (Q336712) (← links)
- An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach (Q427399) (← links)
- Two-stage quadratic integer programs with stochastic right-hand sides (Q431020) (← links)
- Optimization methods for mixed integer weakly concave programming problems (Q489113) (← links)
- An exact penalty function approach for nonlinear integer programming problems (Q580179) (← links)
- The indefinite zero-one quadratic problem (Q585083) (← links)
- Diversification-driven tabu search for unconstrained binary quadratic problems (Q607875) (← links)
- A hybrid metaheuristic approach to solving the UBQP problem (Q613436) (← links)
- On duality for Boolean programming (Q750292) (← links)
- Integer quadratic optimization (Q759647) (← links)
- An unconstrained quadratic binary programming approach to the vertex coloring problem (Q817187) (← links)
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem (Q868442) (← links)
- CON due-date determination and sequencing (Q908841) (← links)
- The spherical constraint in Boolean quadratic programs (Q925238) (← links)
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method (Q1025986) (← links)
- Abandonment value in capital budeting: A mathematical programming approach (Q1088899) (← links)
- A quadratic integer program for the location of interacting hub facilities (Q1092794) (← links)
- Zur effektiven Lösung von booleschen, quadratischen Optimierungsproblemen (Q1168893) (← links)
- Reformulating nonlinear combinatorial optimization problems for higher computational efficiency (Q1194735) (← links)
- Optimal design of a distributed network with a two-level hierarchical structure (Q1203810) (← links)
- Ranking in quadratic integer programming problems (Q1278381) (← links)
- Simulated annealing for the unconstrained quadratic pseudo-Boolean function (Q1296801) (← links)
- One-pass heuristics for large-scale unconstrained binary quadratic problems (Q1600836) (← links)
- An evolutionary heuristic for quadratic 0-1 programming (Q1809845) (← links)
- Parametric Lagrangian dual for the binary quadratic programming problem (Q2018469) (← links)
- Structured linear reformulation of binary quadratically constrained quadratic programs (Q2174904) (← links)
- Path relinking for unconstrained binary quadratic programming (Q2253377) (← links)
- Lower bound improvement and forcing rule for quadratic binary programming (Q2506180) (← links)
- Graph separation techniques for quadratic zero-one programming (Q2638933) (← links)
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming (Q2641083) (← links)
- An algorithm for indefinite integer quadratic programming (Q2641219) (← links)
- Convex relaxation and Lagrangian decomposition for indefinite integer quadratic programming (Q2786313) (← links)
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs (Q2897292) (← links)
- Ellipsoid Bounds for Convex Quadratic Integer Programming (Q2954394) (← links)
- Lagrangean decompositions for the unconstrained binary quadratic programming problem (Q3087848) (← links)
- A tight bound for the boolean quadratic optimization problem and its use in a branch and bound algorithm<sup>1</sup> (Q3807879) (← links)
- Models and methods of solution of quadratic integer programming problems (Q3807880) (← links)
- Mixed-integer quadratic programming (Q3931023) (← links)
- Approximating finite weighted point sets by hyperplanes (Q5056110) (← links)
- Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem (Q5945202) (← links)