Convexification techniques for fractional programs
From MaRDI portal
Cites work
- \(NP\)-hardness of linear multiplicative programming and related problems
- A branch-and-cut algorithm for the latent-class logit assortment problem
- A convex optimization approach for minimizing the ratio of indefinite quadratic functions over an ellipsoid
- A gentle, geometric introduction to copositive optimization
- A global approach for general 0-1 fractional programming
- A global optimization algorithm for linear fractional and bilinear programs
- A guide to formulating fairness in an optimization model
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- A Mixed-Integer Fractional Optimization Approach to Best Subset Selection
- A polyhedral branch-and-cut approach to global optimization
- A polyhedral study of binary polynomial programs
- A second-order cone based approach for solving the trust-region subproblem and its variants
- Advances in MINLP to identify energy-efficient distillation configurations
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- BOND PORTFOLIO OPTIMIZATION BY BILINEAR FRACTIONAL PROGRAMMING
- Boolean query optimization and the 0-1 hyperbolic sum problem
- Chvátal Cuts and Odd Cycle Inequalities in Quadratic 0–1 Optimization
- Combinatorial Optimization with Rational Objective Functions
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Computable representations for convex hulls of low-dimensional quadratic forms
- Convex hull results on quadratic programs with non-intersecting constraints
- Cut-Polytopes, Boolean Quadric Polytopes and Nonnegative Quadratic Pseudo-Boolean Functions
- Discrete and fractional programming techniques for location models
- Disjunctive programming: Properties of the convex hull of feasible points
- Exact Facetial Odd-Cycle Separation for Maximum Cut and Binary Quadratic Optimization
- Explicit convex and concave envelopes through polyhedral subdivisions
- Feature selection for consistent biclustering 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 for Communication Systems—Part I: Power Control and Beamforming
- Geometry of cuts and metrics
- Global optimization of 0-1 hyperbolic programs
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods
- scientific article; zbMATH DE number 3223483 (Why is no real title available?)
- Image space analysis of generalized fractional programs
- Julia: a fresh approach to numerical computing
- Linear vs. semidefinite extended formulations
- Minimizing the Condition Number of a Gram Matrix
- On Cones of Nonnegative Quadratic Functions
- On decomposability of multilinear sets
- On nonconvex quadratic programming with box constraints
- On the copositive representation of binary and continuous nonconvex quadratic programs
- On the cut polytope
- Optimal oblivious routing in polynomial time
- Optimal Server Location on a Network Operating as an M/G/1 Queue
- Programming with linear fractional functionals
- Quadratic programs with hollows
- Semidefinite relaxations of fractional programs via novel convexification techniques
- Short proofs on the matching polyhedron
- Small extended formulations for cyclic polytopes
- Solving a class of feature selection problems via fractional 0--1 programming
- Sparse sums of squares on finite abelian groups and improved semidefinite lifts
- Technical note: A conic integer optimization approach to the constrained assortment problem under the mixed multinomial logit model
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- The cut polytope and the Boolean quadric polytope
- The equitable dispersion problem
- The moment problem
- The multilinear polytope for acyclic hypergraphs
- The Running Intersection Relaxation of the Multilinear Polytope
- The set covering problem with linear fractional functional
- The trust region subproblem with non-intersecting linear constraints
- Using concave envelopes to globally solve the nonlinear sum of ratios problem
This page was built for publication: Convexification techniques for fractional programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6932194)
