A note on a global approach for general 0-1 fractional programming
From MaRDI portal
Publication:1278952
DOI10.1016/S0377-2217(96)00258-5zbMath0916.90252WikidataQ127642372 ScholiaQ127642372MaRDI QIDQ1278952
Publication date: 28 February 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Related Items (41)
A Branch-and-Cut Algorithm for the Latent Class Logit Assortment Problem ⋮ Time variant multi-objective linear fractional interval-valued transportation problem ⋮ Optimization and data mining in medicine ⋮ A geometric branch-and-bound algorithm for the service bundle design problem ⋮ On the linear integration of attraction choice models in business optimization problems ⋮ Spatial and temporal optimization for smart warehouses with fast turnover ⋮ Finding checkerboard patterns via fractional 0-1 programming ⋮ Fractional 0-1 programming: applications and algorithms ⋮ A multicut outer-approximation approach for competitive facility location under random utilities ⋮ On maximum ratio clique relaxations ⋮ A portfolio optimization approach to design of congested multi‐service networks with application in community healthcare: fractional 0‐1 programming ⋮ The Maximum Ratio Clique Problem: A Continuous Optimization Approach and Some New Results ⋮ A simple technique to improve linearized reformulations of fractional (hyperbolic) 0-1 programming problems ⋮ Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems ⋮ Mixed integer programming for the 0--1 maximum probability model. ⋮ Identifying Fixations in Gaze Data via Inner Density and Optimization ⋮ A note on linearized reformulations for a class of bilevel linear integer problems ⋮ Model-based decision support for optimal brochure pricing: applying advanced analytics in the tour operating industry ⋮ A branch-and-cut algorithm for the latent-class logit assortment problem ⋮ Integrated express shipment service network design with customer choice and endogenous delivery time restrictions ⋮ A goal programming approach for fuzzy multiobjective fractional programming problems ⋮ An approximate approach for fractional programming with absolute-value functions ⋮ 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 ⋮ Railway delay management with passenger rerouting considering train capacity constraints ⋮ 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 ⋮ The equitable dispersion problem ⋮ LINEARIZATION OF 0-1 MULTI-QUADRATIC FRACTIONAL PROGRAMMING PROBLEM ⋮ Solution of a fractional combinatorial optimization problem by mixed integer programming ⋮ The attractive traveling salesman problem ⋮ A sixth bibliography of fractional programming ⋮ On the posynomial fractional programming problems ⋮ Project prioritization under policy restrictions. A combination of MCDA with 0-1 programming ⋮ Feature selection for consistent biclustering via fractional 0-1 programming ⋮ Solving the competitive discretionary service facility location problem ⋮ The maximum ratio clique problem
Uses Software
Cites Work
- A global approach for general \(0-1\) fractional programming
- A Parametric Method for Solving the Linear Fractional Programming Problem
- A Branch and Bound Method for Integer Nonlinear Fractional Programs
- Programming with linear fractional functionals
- (0, 1) hyperbolic programming problems
- Hyperbolic integer programming
- Unnamed Item
This page was built for publication: A note on a global approach for general 0-1 fractional programming
