Fractional 0-1 programs: links between mixed-integer linear and conic quadratic formulations
From MaRDI portal
Recommendations
- A simple technique to improve linearized reformulations of fractional (hyperbolic) 0-1 programming problems
- Fractional 0-1 programming: applications and algorithms
- Solution of a fractional combinatorial optimization problem by mixed integer programming
- Problèmes fractionnaires : tour d'horizon sur les applications et méthodes de résolution
- A global approach for general 0-1 fractional programming
Cites work
- A branch-and-cut algorithm for the latent-class logit assortment problem
- A column generation algorithm for choice-based network revenue management
- A fractional programming approach for retail category price optimization
- A global approach for general 0-1 fractional programming
- A lifted linear programming branch-and-bound algorithm for mixed-integer conic quadratic programs
- A Mixed-Integer Fractional Optimization Approach to Best Subset Selection
- A note on a global approach for general 0-1 fractional programming
- A simple recipe for concise mixed 0-1 linearizations
- A simple technique to improve linearized reformulations of fractional (hyperbolic) 0-1 programming problems
- A sixth bibliography of fractional programming
- Assortment optimization under variants of the nested logit model
- Boolean query optimization and the 0-1 hyperbolic sum problem
- Covariate-adaptive optimization in online clinical trials
- Dynamic assortment optimization with a multinomial logit choice model and capacity constraint
- Exact solution of a class of nonlinear knapsack problems
- Extended formulations in mixed integer conic quadratic programming
- Feature selection for consistent biclustering via fractional 0-1 programming
- Finding checkerboard patterns via fractional 0-1 programming
- Fractional 0-1 programming: applications and algorithms
- Fractional 0-1 programs: links between mixed-integer linear and conic quadratic formulations
- Fractional programming
- Global optimization of 0-1 hyperbolic programs
- scientific article; zbMATH DE number 3904328 (Why is no real title available?)
- scientific article; zbMATH DE number 3550467 (Why is no real title available?)
- scientific article; zbMATH DE number 2190133 (Why is no real title available?)
- scientific article; zbMATH DE number 3422402 (Why is no real title available?)
- Hyperbolic 0-1 programming and query optimization in information retrieval
- Hyperbolic set covering problems with competing ground-set elements
- On complexity of unconstrained hyperbolic 0--1 programming problems
- On Polyhedral Approximations of the Second-Order Cone
- Polymatroids and mean-risk minimization in discrete optimization
- Pseudo-Boolean optimization
- Solving a (0, 1) hyperbolic program by branch and bound
- Solving nonlinear covering problems arising in WLAN design
- Submodularity in Conic Quadratic Mixed 0–1 Optimization
- Technical note: A conic integer optimization approach to the constrained assortment problem under the mixed multinomial logit model
Cited in
(12)- A simple technique to improve linearized reformulations of fractional (hyperbolic) 0-1 programming problems
- Green supply chain design with emission sensitive demand: second order cone programming formulation and case study
- Fractional 0-1 programming and submodularity
- 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
- General 0-1 fractional programming with conditional fractional terms for design of food frequency questionnaires
- Formulating the mixed integer fractional posynomial programming
- Minimizing the sum of a linear and a linear fractional function applying conic quadratic representation: continuous and discrete problems
- Convexification techniques for fractional programs
- A branch and cut algorithm to optimize a weighted sum-of-ratios in multiobjective mixed-integer fractional programming
- Computing the edge expansion of a graph using semidefinite programming
- Constrained assortment optimization under the mixed-logit model: approximation schemes and outer approximation approaches
This page was built for publication: Fractional 0-1 programs: links between mixed-integer linear and conic quadratic formulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2274883)
