Quadratic Binary Programming with Application to Capital-Budgeting Problems
From MaRDI portal
Publication:5588323
DOI10.1287/opre.18.3.454zbMath0193.20209OpenAlexW2122604873MaRDI QIDQ5588323
Publication date: 1970
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.18.3.454
Related Items
\(f\)-flip strategies for unconstrained binary quadratic programming, Applications and Computational Advances for Solving the QUBO Model, Unnamed Item, Non-linear integer programming: Sensitivity analysis for branch and bound, Executing join queries in an uncertain distributed environment, An algorithm for indefinite integer quadratic programming, Allocating relations in a distributed database system, A discrete optimization model for preserving biological diversity, A computational comparison of branch and bound and outer approximation algorithms for 0-1 mixed integer nonlinear programs, An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs, Diversification-driven tabu search for unconstrained binary quadratic problems, A hybrid metaheuristic approach to solving the UBQP problem, The unconstrained binary quadratic programming problem: a survey, A hybrid approach to resolving a differentiable integer program., Some algebraic methods for solving multiobjective polynomial integer programs, Computer experiments on quadratic programming algorithms, Bounds for Random Binary Quadratic Programs, Models and methods of solution of quadratic integer programming problems, A survey on the continuous nonlinear resource allocation problem, The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds, Reformulating nonlinear combinatorial optimization problems for higher computational efficiency, An approximate method for local optima for nonlinear mixed integer programming problems, Pseudo-Boolean optimization, The indefinite zero-one quadratic problem, Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation, Tightening concise linear reformulations of 0-1 cubic programs, A new upper bound for the 0-1 quadratic knapsack problem, Lagrangean decompositions for the unconstrained binary quadratic programming problem, Linear programming for the \(0-1\) quadratic knapsack problem, Concise RLT forms of binary programs: A computational study of the quadratic knapsack problem, An approximate dynamic programming approach to convex quadratic knapsack problems, A dual ascent method for the portfolio selection problem with multiple constraints and linked proposals, Unconstrained quadratic bivalent programming problem, Unit integer quadratic binary programming, Solving the 0-1 quadratic knapsack problem with a competitive quantum inspired evolutionary algorithm, One-pass heuristics for large-scale unconstrained binary quadratic problems, An improved branch and bound algorithm for mixed integer nonlinear programs, An unconstrained quadratic binary programming approach to the vertex coloring problem
