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

DOI10.1016/j.ejor.2022.03.044OpenAlexW4221029404WikidataQ113875412 ScholiaQ113875412MaRDI QIDQ2160490

Xiangtong Qi, Yi Fu Li

Publication date: 3 August 2022

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2022.03.044

zbMATH Keywords

schedulingservice design0-1 sum-of-ratios problemgeometric branch-and-bound algorithm

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Unnamed Item
• A practicable branch and bound algorithm for sum of linear ratios problem
• Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods
• A note on a global approach for general 0-1 fractional programming
• A simple technique to improve linearized reformulations of fractional (hyperbolic) 0-1 programming problems
• Discrete and geometric branch and bound algorithms for~medical image registration
• 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 solution algorithm for non-convex mixed integer optimization problems with only few continuous variables
• A global optimization algorithm for solving the minimum multiple ratio spanning tree problem
• 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
• Fractional programming: The sum-of-ratios case
• Three Ideas for the Quadratic Assignment Problem
• Integer Programming
• A new linearization method for quadratic assignment problems
• LINEARIZATION OF 0-1 MULTI-QUADRATIC FRACTIONAL PROGRAMMING PROBLEM
• Parametric approaches to fractional programs
• A ninth bibliography of fractional programming
• A Class of Fractional Programming Problems
• Minimum spanning trees with sums of ratios.
• On the polynomial mixed 0-1 fractional programming problems

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