Fractional 0-1 programming: applications and algorithms
From MaRDI portal
Publication:1675651
DOI10.1007/s10898-016-0487-4zbMath1379.90017OpenAlexW2562156970MaRDI QIDQ1675651
Colin Gillen, Oleg A. Prokopyev, Juan S. Borrero
Publication date: 2 November 2017
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-016-0487-4
fractional 0-1 programmingbinary optimizationnonlinear integer optimizationhyperbolic 0-1 programming
Related Items
Exact approaches for competitive facility location with discrete attractiveness ⋮ Fractional 0-1 programming and submodularity ⋮ Approximation guarantees of algorithms for fractional optimization problems arising in dispatching rules for INDS problems ⋮ Exact solution approaches for a class of bilevel fractional programs ⋮ 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 ⋮ Solving a class of feature selection problems via fractional 0--1 programming ⋮ Fractional 0-1 programs: links between mixed-integer linear and conic quadratic formulations ⋮ Branch-and-cut approach based on generalized Benders decomposition for facility location with limited choice rule ⋮ A Mixed-Integer Fractional Optimization Approach to Best Subset Selection ⋮ Column generation extensions of set covering greedy heuristics
Cites Work
- Approximate And Exact Solution Methods For The Hyperbolic 0-1 Knapsack Problem
- Fractional programming
- Minimum spanning trees with sums of ratios.
- On the polynomial mixed 0-1 fractional programming problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The unconstrained binary quadratic programming problem: a survey
- A branch-and-cut algorithm for the latent-class logit assortment problem
- Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
- Finding checkerboard patterns via fractional 0-1 programming
- Two strongly polynomial cut cancelling algorithms for minimum cost network flow
- Pseudo-Boolean optimization
- A new linearization technique for multi-quadratic 0-1 programming problems.
- A fractional programming approach for retail category price optimization
- Scheduling tasks with exponential duration on unrelated parallel machines
- Hyperbolic set covering problems with competing ground-set elements
- Exact solution of a class of nonlinear knapsack problems
- The equitable dispersion problem
- Global optimization for a class of fractional programming problems
- The set covering problem with linear fractional functional
- Hyperbolic 0-1 programming and query optimization in information retrieval
- Global optimization of fractional programs
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
- New scaling algorithms for the assignment and minimum mean cycle problems
- Integer programming formulation of combinatorial optimization problems
- A characterization of the minimum cycle mean in a digraph
- A note on a global approach for general 0-1 fractional programming
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- Queueing delay guarantees in bandwidth packing
- Image space analysis of generalized fractional programs
- A new saling algorithm for the maximum mean cut problem
- A global approach for general \(0-1\) fractional programming
- Computing maximum mean cuts
- Boolean query optimization and the 0-1 hyperbolic sum problem
- A simple technique to improve linearized reformulations of fractional (hyperbolic) 0-1 programming problems
- On the tightness of an LP relaxation for rational optimization and its applications
- On complexity of unconstrained hyperbolic 0--1 programming problems
- On the sum-product ratio problem and its applications
- Bandwidth packing with queuing delay costs: Bounding and heuristic solution procedures
- Global optimization of 0-1 hyperbolic programs
- An algorithm for fractional assignment problems
- Approximation algorithms for fractional knapsack problems
- A simple recipe for concise mixed 0-1 linearizations
- A global optimization algorithm for linear fractional and bilinear programs
- An FPTAS for minimizing a class of low-rank quasi-concave functions over a convex set
- The maximum ratio clique problem
- Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs
- A global optimization algorithm for solving the minimum multiple ratio spanning tree problem
- Uniqueness in quadratic and hyperbolic \(0-1\) programming problems
- Linear forms of nonlinear expressions: new insights on old ideas
- An improved linearization strategy for zero-one quadratic programming problems
- A class of inverse dominant problems under weighted \(l_{\infty }\) norm and an improved complexity bound for Radzik's algorithm
- The complexity of minimum ratio spanning tree problems
- Feature selection for consistent biclustering via fractional 0-1 programming
- Approximating a class of combinatorial problems with rational objective function
- Solving Mixed Integer Bilinear Problems Using MILP Formulations
- Assortment Optimization Under Variants of the Nested Logit Model
- Solving Nonlinear Covering Problems Arising in WLAN Design
- Fractional programming: The sum-of-ratios case
- A Column Generation Algorithm for Choice-Based Network Revenue Management
- Finding minimum cost to time ratio cycles with small integral transit times
- Finding minimum-cost circulations by canceling negative cycles
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- A Proof for the Queuing Formula: L = λW
- Combinatorial Optimization with Rational Objective Functions
- Methods of Nonlinear 0-1 Programming
- A Survey of Methods for Pure Nonlinear Integer Programming
- A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- Solving a (0, 1) hyperbolic program by branch and bound
- On Solving Fractional (0, 1) Programs By Implicit Enumeration
- Fractional Programming. II, On Dinkelbach's Algorithm
- Duality and Sensitivity Analysis for Fractional Programs
- Minimal ratio spanning trees
- Fractional knapsack problems
- State-of-the-Art Survey—Constrained Nonlinear 0–1 Programming
- Global Optimization for Mixed 0-1 Programs with Convex or Separable Continuous Functions
- Approximation algorithms for combinatorial fractional programming problems
- Parametric approaches to fractional programs
- Base-2 Expansions for Linearizing Products of Functions of Discrete Variables
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- Hyperbolic programming
- The Maximum Ratio Clique Problem: A Continuous Optimization Approach and Some New Results
- On Nonlinear Fractional Programming
- (0, 1) hyperbolic programming problems
- A Class of Fractional Programming Problems
- Hyperbolic integer programming
- Faster parametric shortest path and minimum‐balance algorithms
