Quadratic Binary Programming with Application to Capital-Budgeting Problems
From MaRDI portal
Cited in
(40)- Computer experiments on quadratic programming algorithms
- Allocating relations in a distributed database system
- Non-linear integer programming: Sensitivity analysis for branch and bound
- f-flip strategies for unconstrained binary quadratic programming
- An unconstrained quadratic binary programming approach to the vertex coloring problem
- The indefinite zero-one quadratic problem
- Applications and computational advances for solving the QUBO model
- A hybrid approach to resolving a differentiable integer program.
- The unconstrained binary quadratic programming problem: a survey
- Pseudo-Boolean optimization
- Unconstrained quadratic bivalent programming problem
- An algorithm for indefinite integer quadratic programming
- An improved branch and bound algorithm for mixed integer nonlinear programs
- The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds
- One-pass heuristics for large-scale unconstrained binary quadratic problems
- Unit integer quadratic binary programming
- Reformulating nonlinear combinatorial optimization problems for higher computational efficiency
- An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs
- A hybrid metaheuristic approach to solving the UBQP problem
- A dual ascent method for the portfolio selection problem with multiple constraints and linked proposals
- Some algebraic methods for solving multiobjective polynomial integer programs
- Diversification-driven tabu search for unconstrained binary quadratic problems
- A survey on the continuous nonlinear resource allocation problem
- A new upper bound for the 0-1 quadratic knapsack problem
- Solving the 0-1 quadratic knapsack problem with a competitive quantum inspired evolutionary algorithm
- Models and methods of solution of quadratic integer programming problems
- An approximate method for local optima for nonlinear mixed integer programming problems
- Executing join queries in an uncertain distributed environment
- Lagrangean decompositions for the unconstrained binary quadratic programming problem
- Tightening concise linear reformulations of 0-1 cubic programs
- Linear programming for the \(0-1\) quadratic knapsack problem
- Quadratic unconstrained binary optimization problem preprocessing: theory and empirical analysis
- Bounds for random binary quadratic programs
- Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation
- Aspects of stability for multicriteria quadratic problems of Boolean programming
- A computational comparison of branch and bound and outer approximation algorithms for 0-1 mixed integer nonlinear programs
- Concise RLT forms of binary programs: a computational study of the quadratic knapsack problem
- A discrete optimization model for preserving biological diversity
- The quadratic knapsack problem
- An approximate dynamic programming approach to convex quadratic knapsack problems
This page was built for publication: Quadratic Binary Programming with Application to Capital-Budgeting Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5588323)
