A simple technique to improve linearized reformulations of fractional (hyperbolic) 0-1 programming problems
type: Item
instance of: scholarly article
title: A simple technique to improve linearized reformulations of fractional (hyperbolic) 0-1 programming problems
zbMATH Open document ID: 1380.90261
author: Juan S. Borrero
author: Colin Gillen
author: Oleg A. Prokopyev
published in: Operations Research Letters
publication date: 2018-02-06T00:00:00Z
Mathematics Subject Classification ID: 90C32
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C11
zbMATH DE Number: 6835045
zbMATH Keywords: fractional 0-1 programming
zbMATH Keywords: hyperbolic 0-1 programming
zbMATH Keywords: linearization
zbMATH Keywords: binary representations
zbMATH Keywords: mixed integer linear programs
MaRDI profile type: Publication
full work available at URL: j.orl.2016.03.015
OpenAlex ID: W2345619004
cites work: A simple recipe for concise mixed 0-1 linearizations
cites work: Linear forms of nonlinear expressions: new insights on old ideas
cites work: Base-2 Expansions for Linearizing Products of Functions of Discrete Variables
cites work: An Alternate Method on Integer Solutions to Linear Fractional Functionals by a Branch and Bound Technique
cites work: Hyperbolic set covering problems with competing ground-set elements
cites work: The set covering problem with linear fractional functional
cites work: Pseudo-Boolean optimization
cites work: Feature selection for consistent biclustering via fractional 0-1 programming
cites work: A new linearization technique for multi-quadratic 0-1 programming problems.
cites work: A Linear Programming Approach to the Cutting Stock Problem—Part II
cites work: On Solving Fractional (0, 1) Programs By Implicit Enumeration
cites work: Hyperbolic integer programming
cites work: Boolean query optimization and the 0-1 hyperbolic sum problem
cites work: Hyperbolic 0-1 programming and query optimization in information retrieval
cites work: Integer programming formulation of combinatorial optimization problems
cites work: A global approach for general \(0-1\) fractional programming
cites work: A branch-and-cut algorithm for the latent-class logit assortment problem
cites work: On complexity of unconstrained hyperbolic 0--1 programming problems
cites work: Q5462193
cites work: Solving a (0, 1) hyperbolic program by branch and bound
cites work: An improved linearization strategy for zero-one quadratic programming problems
cites work: A fractional programming approach for retail category price optimization
cites work: Global optimization of 0-1 hyperbolic programs
cites work: Finding checkerboard patterns via fractional 0-1 programming
cites work: Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
cites work: Q4124606
cites work: A note on a global approach for general 0-1 fractional programming
DOI: 10.1016/J.ORL.2016.03.015
description: scientific article; zbMATH DE number 6835045