A geometric branch-and-bound algorithm for the service bundle design problem

Cites Work

Fractional programming: The sum-of-ratios case
A note on a global approach for general 0-1 fractional programming
A Class of Fractional Programming Problems
Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods
A practicable branch and bound algorithm for sum of linear ratios problem
Three Ideas for the Quadratic Assignment Problem
A new linearization method for quadratic assignment problems
Title not available (Why is that?)
Parametric approaches to fractional programs
Integer Programming
A solution algorithm for non-convex mixed integer optimization problems with only few continuous variables
A ninth bibliography of fractional programming
Discrete and geometric branch and bound algorithms for~medical image registration
On the polynomial mixed 0-1 fractional programming problems
Minimum spanning trees with sums of ratios.
A simple technique to improve linearized reformulations of fractional (hyperbolic) 0-1 programming problems
A global optimization algorithm for solving the minimum multiple ratio spanning tree problem
A parametric approach to integer linear fractional programming: Newton's and hybrid-Newton methods for an optimal road maintenance problem
Optimal bundle composition in competition for continuous attributes
Discriminant analysis of distributional data via fractional programming
A practicable contraction approach for the sum of the generalized polynomial ratios problem
Improving efficiency of service systems by performing a part of the service without the customer's presence
LINEARIZATION OF 0-1 MULTI-QUADRATIC FRACTIONAL PROGRAMMING PROBLEM

This page was built for publication: A geometric branch-and-bound algorithm for the service bundle design problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2160490)