A simple technique to improve linearized reformulations of fractional (hyperbolic) 0-1 programming problems
From MaRDI portal
Publication:1694780
DOI10.1016/j.orl.2016.03.015zbMath1380.90261OpenAlexW2345619004MaRDI QIDQ1694780
Oleg A. Prokopyev, Juan S. Borrero, Colin Gillen
Publication date: 6 February 2018
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2016.03.015
linearizationfractional 0-1 programmingmixed integer linear programsbinary representationshyperbolic 0-1 programming
Related Items (10)
A geometric branch-and-bound algorithm for the service bundle design problem ⋮ Fractional 0-1 programming and submodularity ⋮ Approximation guarantees of algorithms for fractional optimization problems arising in dispatching rules for INDS problems ⋮ Fractional 0-1 programming: applications and algorithms ⋮ 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 ⋮ Submodularity in Conic Quadratic Mixed 0–1 Optimization ⋮ A note on linearized reformulations for a class of bilevel linear integer problems ⋮ Green supply chain design with emission sensitive demand: second order cone programming formulation and case study ⋮ Fractional 0-1 programs: links between mixed-integer linear and conic quadratic formulations
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- Pseudo-Boolean optimization
- A new linearization technique for multi-quadratic 0-1 programming problems.
- A fractional programming approach for retail category price optimization
- Hyperbolic set covering problems with competing ground-set elements
- The set covering problem with linear fractional functional
- Hyperbolic 0-1 programming and query optimization in information retrieval
- Integer programming formulation of combinatorial optimization problems
- A note on a global approach for general 0-1 fractional programming
- A global approach for general \(0-1\) fractional programming
- Boolean query optimization and the 0-1 hyperbolic sum problem
- On complexity of unconstrained hyperbolic 0--1 programming problems
- Global optimization of 0-1 hyperbolic programs
- A simple recipe for concise mixed 0-1 linearizations
- Linear forms of nonlinear expressions: new insights on old ideas
- An improved linearization strategy for zero-one quadratic programming problems
- Feature selection for consistent biclustering via fractional 0-1 programming
- Solving a (0, 1) hyperbolic program by branch and bound
- On Solving Fractional (0, 1) Programs By Implicit Enumeration
- An Alternate Method on Integer Solutions to Linear Fractional Functionals by a Branch and Bound Technique
- Base-2 Expansions for Linearizing Products of Functions of Discrete Variables
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- Hyperbolic integer programming
This page was built for publication: A simple technique to improve linearized reformulations of fractional (hyperbolic) 0-1 programming problems
