Fractional 0-1 programming: applications and algorithms
From MaRDI portal
Recommendations
Cites work
- (0, 1) hyperbolic programming problems
- A branch-and-cut algorithm for the latent-class logit assortment problem
- A characterization of the minimum cycle mean in a digraph
- A Class of Fractional Programming Problems
- A class of inverse dominant problems under weighted \(l_{\infty }\) norm and an improved complexity bound for Radzik's algorithm
- 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 global optimization algorithm for linear fractional and bilinear programs
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
- A global optimization algorithm for solving the minimum multiple ratio spanning tree problem
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory
- A new linearization technique for multi-quadratic 0-1 programming problems.
- A new saling algorithm for the maximum mean cut problem
- A note on a global approach for general 0-1 fractional programming
- A Proof for the Queuing Formula: L = λW
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- A simple recipe for concise mixed 0-1 linearizations
- A simple technique to improve linearized reformulations of fractional (hyperbolic) 0-1 programming problems
- A Survey of Methods for Pure Nonlinear Integer Programming
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- An algorithm for fractional assignment problems
- An FPTAS for minimizing a class of low-rank quasi-concave functions over a convex set
- An improved linearization strategy for zero-one quadratic programming problems
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Approximate And Exact Solution Methods For The Hyperbolic 0-1 Knapsack Problem
- Approximating a class of combinatorial problems with rational objective function
- Approximation algorithms for combinatorial fractional programming problems
- Approximation algorithms for fractional knapsack problems
- Assortment optimization under variants of the nested logit model
- Bandwidth packing with queuing delay costs: Bounding and heuristic solution procedures
- Base-2 expansions for linearizing products of functions of discrete variables
- Boolean query optimization and the 0-1 hyperbolic sum problem
- Combinatorial Optimization with Rational Objective Functions
- Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs
- Computing maximum mean cuts
- Duality and Sensitivity Analysis for Fractional Programs
- Exact solution of a class of nonlinear knapsack problems
- Faster parametric shortest path and minimum‐balance algorithms
- Feature selection for consistent biclustering via fractional 0-1 programming
- Finding checkerboard patterns via fractional 0-1 programming
- Finding minimum cost to time ratio cycles with small integral transit times
- Finding minimum-cost circulations by canceling negative cycles
- Fractional knapsack problems
- Fractional programming
- Fractional programming: The sum-of-ratios case
- Fractional Programming. II, On Dinkelbach's Algorithm
- Global optimization for a class of fractional programming problems
- Global Optimization for Mixed 0-1 Programs with Convex or Separable Continuous Functions
- Global optimization of 0-1 hyperbolic programs
- Global optimization of fractional programs
- scientific article; zbMATH DE number 3643026 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 3465108 (Why is no real title available?)
- scientific article; zbMATH DE number 3522951 (Why is no real title available?)
- scientific article; zbMATH DE number 3550467 (Why is no real title available?)
- scientific article; zbMATH DE number 1256704 (Why is no real title available?)
- scientific article; zbMATH DE number 1095224 (Why is no real title available?)
- scientific article; zbMATH DE number 3438629 (Why is no real title available?)
- scientific article; zbMATH DE number 1501879 (Why is no real title available?)
- scientific article; zbMATH DE number 757682 (Why is no real title available?)
- scientific article; zbMATH DE number 2190133 (Why is no real title available?)
- scientific article; zbMATH DE number 3249560 (Why is no real title available?)
- scientific article; zbMATH DE number 3302125 (Why is no real title available?)
- scientific article; zbMATH DE number 3368471 (Why is no real title available?)
- scientific article; zbMATH DE number 3197631 (Why is no real title available?)
- Hyperbolic 0-1 programming and query optimization in information retrieval
- Hyperbolic integer programming
- Hyperbolic programming
- Hyperbolic set covering problems with competing ground-set elements
- Image space analysis of generalized fractional programs
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- Integer programming formulation of combinatorial optimization problems
- Linear forms of nonlinear expressions: new insights on old ideas
- Methods of Nonlinear 0-1 Programming
- Minimal ratio spanning trees
- Minimum spanning trees with sums of ratios.
- Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
- New scaling algorithms for the assignment and minimum mean cycle problems
- On complexity of unconstrained hyperbolic 0--1 programming problems
- On Nonlinear Fractional Programming
- On Solving Fractional (0, 1) Programs By Implicit Enumeration
- On the polynomial mixed 0-1 fractional programming problems
- On the sum-product ratio problem and its applications
- On the tightness of an LP relaxation for rational optimization and its applications
- Parametric approaches to fractional programs
- Parametric flows, weighted means of cuts, and fractional combinatorial optimization
- Pseudo-Boolean optimization
- Queueing delay guarantees in bandwidth packing
- Scheduling tasks with exponential duration on unrelated parallel machines
- Solving a (0, 1) hyperbolic program by branch and bound
- Solving mixed integer bilinear problems using MILP formulations
- Solving nonlinear covering problems arising in WLAN design
- State-of-the-Art Survey—Constrained Nonlinear 0–1 Programming
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- The complexity of minimum ratio spanning tree problems
- The equitable dispersion problem
- The maximum ratio clique problem
- The maximum ratio clique problem: A continuous optimization approach and some new results
- The set covering problem with linear fractional functional
- The unconstrained binary quadratic programming problem: a survey
- Two strongly polynomial cut cancelling algorithms for minimum cost network flow
- Uniqueness in quadratic and hyperbolic \(0-1\) programming problems
Cited in
(23)- A note on a global approach for general 0-1 fractional programming
- Global optimization of 0-1 hyperbolic programs
- Branch-and-cut approach based on generalized Benders decomposition for facility location with limited choice rule
- Column generation extensions of set covering greedy heuristics
- 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
- 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
- A Branch and Bound Algorithm for a Fractional 0-1 Programming Problem
- scientific article; zbMATH DE number 3848997 (Why is no real title available?)
- 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 Mixed-Integer Fractional Optimization Approach to Best Subset Selection
- A polynomial algorithm for a class of 0-1 fractional programming problems involving composite functions, with an application to additive clustering
- 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
- Convexification techniques for fractional programs
- A branch and cut algorithm to optimize a weighted sum-of-ratios in multiobjective mixed-integer fractional programming
- The inverse optimal value problem for linear fractional programming
- Numerical range of real-valued linear mapping on the complex Stiefel manifold: convexity and application
- Exact approaches for competitive facility location with discrete attractiveness
This page was built for publication: Fractional 0-1 programming: applications and algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1675651)
