A global approach for general \(0-1\) fractional programming
From MaRDI portal
Publication:1328656
DOI10.1016/0377-2217(94)90257-7zbMath0806.90119OpenAlexW1983421222MaRDI QIDQ1328656
Publication date: 26 July 1994
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(94)90257-7
Related Items
Multicriteria energy policy investments and energy market clearance via integer programming ⋮ A fifth bibliography of fractional programming* ⋮ Large neighborhood search applied to the software module clustering problem ⋮ Mixed-integer linear programming formulations for the software clustering problem ⋮ On the linear integration of attraction choice models in business optimization problems ⋮ Fractional 0-1 programming: applications and algorithms ⋮ A portfolio optimization approach to design of congested multi‐service networks with application in community healthcare: fractional 0‐1 programming ⋮ A simple technique to improve linearized reformulations of fractional (hyperbolic) 0-1 programming problems ⋮ Mixed integer programming for the 0--1 maximum probability model. ⋮ Model-based decision support for optimal brochure pricing: applying advanced analytics in the tour operating industry ⋮ INTERACTIVE DECISION MAKING USING POSSIBILITY AND NECESSITY MEASURES FOR A FUZZY RANDOM MULTIOBJECTIVE 0–1 PROGRAMMING PROBLEM ⋮ The packing while traveling problem ⋮ A goal programming approach for fuzzy multiobjective fractional programming problems ⋮ Two weighted fuzzy goal programming methods to solve multiobjective goal programming problem ⋮ An approximate approach for fractional programming with absolute-value functions ⋮ A fuzzy random multiobjective 0--1 programming based on the expectation optimization model using possibility and necessity measures ⋮ On the polynomial mixed 0-1 fractional programming problems ⋮ Formulating the mixed integer fractional posynomial programming ⋮ On complexity of unconstrained hyperbolic 0--1 programming problems ⋮ Fractional 0-1 programs: links between mixed-integer linear and conic quadratic formulations ⋮ Product line optimization in the presence of preferences for compromise alternatives ⋮ A review of choice-based revenue management: theory and methods ⋮ 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 note on a global approach for general 0-1 fractional programming ⋮ Solution of a fractional combinatorial optimization problem by mixed integer programming ⋮ An approximate approach of global optimization for polynomial programming problems ⋮ On the posynomial fractional programming problems
Uses Software
Cites Work
- An implicit branch-and-bound algorithm for mixed-integer linear programming
- An approximate method for local optima for nonlinear mixed integer programming problems
- On implementation of computational algorithms for optimal design 2: Extensive numerical investigation
- On Solving Fractional (0, 1) Programs By Implicit Enumeration
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- Programming with linear fractional functionals
- (0, 1) hyperbolic programming problems
- Hyperbolic integer programming
- Unnamed Item
- Unnamed Item
- Unnamed Item
