On the polynomial mixed 0-1 fractional programming problems
From MaRDI portal
Publication:5937360
DOI10.1016/S0377-2217(00)00097-7zbMath0979.90089OpenAlexW2019633452WikidataQ126653705 ScholiaQ126653705MaRDI QIDQ5937360
Publication date: 25 February 2002
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(00)00097-7
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Fractional programming (90C32) Boolean programming (90C09)
Related Items (14)
Time variant multi-objective linear fractional interval-valued transportation problem ⋮ A geometric branch-and-bound algorithm for the service bundle design problem ⋮ Fractional 0-1 programming: applications and algorithms ⋮ Solving a class of feature selection problems via fractional 0--1 programming ⋮ A goal programming approach for fuzzy multiobjective fractional programming problems ⋮ An approximate approach for fractional programming with absolute-value functions ⋮ An integrated JIT--PQD model for enhancing buyer--supplier linkage (revised version) ⋮ Formulating the mixed integer fractional posynomial programming ⋮ Linearization of a 0-1 quadratic fractional programming problem ⋮ Minimizing the sum of a linear and a linear fractional function applying conic quadratic representation: continuous and discrete problems ⋮ LINEARIZATION OF 0-1 MULTI-QUADRATIC FRACTIONAL PROGRAMMING PROBLEM ⋮ A sixth bibliography of fractional programming ⋮ On the posynomial fractional programming problems ⋮ A Polynomial Algorithm for a Class of 0–1 Fractional Programming Problems Involving Composite Functions, with an Application to Additive Clustering
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A note on a global approach for general 0-1 fractional programming
- A global approach for general \(0-1\) fractional programming
- An efficient linearization approach for mixed-integer problems
- A Parametric Method for Solving the Linear Fractional Programming Problem
- A Branch and Bound Method for Integer Nonlinear Fractional Programs
- Fractional Minmax Goal Programming: A Unified Approach to Priority Estimation and Preference Analysis in MCDM
- Programming with linear fractional functionals
- (0, 1) hyperbolic programming problems
This page was built for publication: On the polynomial mixed 0-1 fractional programming problems