Pages that link to "Item:Q5588323"

The following pages link to Quadratic Binary Programming with Application to Capital-Budgeting Problems (Q5588323):

Displaying 35 items.

• \(f\)-flip strategies for unconstrained binary quadratic programming (Q271994) (← links)
• The unconstrained binary quadratic programming problem: a survey (Q405668) (← links)
• The indefinite zero-one quadratic problem (Q585083) (← links)
• An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs (Q604951) (← links)
• Diversification-driven tabu search for unconstrained binary quadratic problems (Q607875) (← links)
• A hybrid metaheuristic approach to solving the UBQP problem (Q613436) (← links)
• Some algebraic methods for solving multiobjective polynomial integer programs (Q633078) (← links)
• Pseudo-Boolean optimization (Q697569) (← links)
• Unconstrained quadratic bivalent programming problem (Q792219) (← links)
• An unconstrained quadratic binary programming approach to the vertex coloring problem (Q817187) (← links)
• Unit integer quadratic binary programming (Q1053599) (← links)
• Non-linear integer programming: Sensitivity analysis for branch and bound (Q1099075) (← links)
• Computer experiments on quadratic programming algorithms (Q1154392) (← links)
• The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds (Q1179735) (← links)
• Reformulating nonlinear combinatorial optimization problems for higher computational efficiency (Q1194735) (← links)
• An approximate method for local optima for nonlinear mixed integer programming problems (Q1200840) (← links)
• Linear programming for the \(0-1\) quadratic knapsack problem (Q1268263) (← links)
• A dual ascent method for the portfolio selection problem with multiple constraints and linked proposals (Q1296022) (← links)
• An improved branch and bound algorithm for mixed integer nonlinear programs (Q1318452) (← links)
• A computational comparison of branch and bound and outer approximation algorithms for 0-1 mixed integer nonlinear programs (Q1370656) (← links)
• A hybrid approach to resolving a differentiable integer program. (Q1406652) (← links)
• One-pass heuristics for large-scale unconstrained binary quadratic problems (Q1600836) (← links)
• A new upper bound for the 0-1 quadratic knapsack problem (Q1806683) (← links)
• Executing join queries in an uncertain distributed environment (Q1900302) (← links)
• Allocating relations in a distributed database system (Q1903394) (← links)
• A discrete optimization model for preserving biological diversity (Q1909481) (← links)
• Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation (Q2045008) (← links)
• Solving the 0-1 quadratic knapsack problem with a competitive quantum inspired evolutionary algorithm (Q2345653) (← links)
• A survey on the continuous nonlinear resource allocation problem (Q2456404) (← links)
• An approximate dynamic programming approach to convex quadratic knapsack problems (Q2566930) (← links)
• An algorithm for indefinite integer quadratic programming (Q2641219) (← links)
• Tightening concise linear reformulations of 0-1 cubic programs (Q2810099) (← links)
• Lagrangean decompositions for the unconstrained binary quadratic programming problem (Q3087848) (← links)
• Concise RLT forms of binary programs: A computational study of the quadratic knapsack problem (Q3406118) (← links)
• Quadratic unconstrained binary optimization problem preprocessing: theory and empirical analysis (Q6496345) (← links)