Constrained integer fractional programming problem with box constraints
type: Item
instance of: scholarly article
title: Constrained integer fractional programming problem with box constraints
zbMATH Open document ID: 1387.90131
author: Kalpana Dahiya
published in: S\(\vec{\text{e}}\)MA Journal
publication date: 2018-01-12T00:00:00Z
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C32
zbMATH DE Number: 6825223
zbMATH Keywords: fractional programming
zbMATH Keywords: box constraints
zbMATH Keywords: integer programming
zbMATH Keywords: constrained problem
MaRDI profile type: Publication
full work available at URL: s40324-016-0093-x
OpenAlex ID: W2529660421
cites work: Nonlinear chance constrained problems: optimality conditions, regularization and solvers
cites work: A strongly polynomial method for solving integer max-linear optimization problems in a generic case
cites work: Cutting planes for integer programs with general integer variables
cites work: The free parametrization for linear programming with bounded variables
cites work: Fixing variables and generating classical cutting planes when using an interior point branch and cut method to solve integer programming problems
cites work: Ranking in integer programming with bounded variables.
cites work: Image space analysis of generalized fractional programs
cites work: Cutting-plane method based on epigraph approximation with discarding the cutting planes
cites work: Sequence independent lifting in mixed integer programming
cites work: Q4810992
cites work: Q4266762
cites work: Minimization of the sum of three linear fractional functions
cites work: Integer Programming with Bounded Variables via Canonical Separation
cites work: Cutting planes in integer and mixed integer programming
cites work: Fractional programming formulation for the vertex coloring problem
cites work: Computational Experience with an Interior Point Cutting Plane Algorithm
cites work: Polynomial Interior Point Cutting Plane Methods
cites work: Q3674396
cites work: Q4133393
cites work: A new algorithm for linear multiobjective programming problems with bounded variables
cites work: Q4082544
cites work: SOME ASPECTS OF LINEAR FRACTIONAL FUNCTIONALS PROGRAMMING
cites work: Q4833811
cites work: An Algorithm for the Bounded Variable Integer Programming Problem
cites work: An iterative approach to solve multiobjective linear fractional programming problems
cites work: Constrained integer linear fractional programming problem
cites work: Ranking in integer linear fractional programming problems
cites work: A breakpoint search approach for convex resource allocation problems with bounded variables
cites work: One approach to constructing cutting algorithms with dropping of cutting planes
DOI: 10.1007/S40324-016-0093-X
description: scientific article; zbMATH DE number 6825223