Constrained integer fractional programming problem with box constraints

DOI10.1007/s40324-016-0093-xzbMath1387.90131OpenAlexW2529660421MaRDI QIDQ1689256

Kalpana Dahiya

Publication date: 12 January 2018

Published in: S\(\vec{\text{e}}\)MA Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40324-016-0093-x

zbMATH Keywords

integer programmingbox constraintsfractional programmingconstrained problem

Mathematics Subject Classification ID

Integer programming (90C10) Fractional programming (90C32)

Cites Work

• Cutting-plane method based on epigraph approximation with discarding the cutting planes
• Nonlinear chance constrained problems: optimality conditions, regularization and solvers
• One approach to constructing cutting algorithms with dropping of cutting planes
• Fractional programming formulation for the vertex coloring problem
• A new algorithm for linear multiobjective programming problems with bounded variables
• A breakpoint search approach for convex resource allocation problems with bounded variables
• Cutting planes in integer and mixed integer programming
• The free parametrization for linear programming with bounded variables
• Fixing variables and generating classical cutting planes when using an interior point branch and cut method to solve integer programming problems
• Cutting planes for integer programs with general integer variables
• Image space analysis of generalized fractional programs
• Minimization of the sum of three linear fractional functions
• Sequence independent lifting in mixed integer programming
• An iterative approach to solve multiobjective linear fractional programming problems
• A strongly polynomial method for solving integer max-linear optimization problems in a generic case
• Ranking in integer programming with bounded variables.
• Integer Programming with Bounded Variables via Canonical Separation
• Computational Experience with an Interior Point Cutting Plane Algorithm
• Polynomial Interior Point Cutting Plane Methods
• An Algorithm for the Bounded Variable Integer Programming Problem
• SOME ASPECTS OF LINEAR FRACTIONAL FUNCTIONALS PROGRAMMING
• Constrained integer linear fractional programming problem
• Ranking in integer linear fractional programming problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Constrained integer fractional programming problem with box constraints