Ranking in integer programming with bounded variables.
From MaRDI portal
Publication:2476433
DOI10.1007/BF03398734zbMATH Open1158.90387OpenAlexW2773285351MaRDI QIDQ2476433FDOQ2476433
Authors: Kalpana Dahiya, Vanita Verma 
Publication date: 19 March 2008
Published in: Opsearch (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf03398734
Recommendations
- Ranking in integer linear fractional programming problems
- Ranking in quadratic integer programming problems
- Integer quadratic fractional programming problems with bounded variables
- On ranking of feasible solutions of a bottleneck linear programming problem
- A ranking algorithm for bi-objective quadratic fractional integer programming problems
Fractional programming (90C32) Integer programming (90C10) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- SOME ASPECTS OF LINEAR FRACTIONAL FUNCTIONALS PROGRAMMING
- Title not available (Why is that?)
- Ranking in integer linear fractional programming problems
- A note on integer linear fractional programming
- An Improved Branch and Bound Method for Mixed Integer Linear Fractional Programs
Cited In (5)
- Ranking in integer linear fractional programming problems
- Integer quadratic fractional programming problems with bounded variables
- Constrained integer fractional programming problem with box constraints
- A ranking algorithm for bi-objective quadratic fractional integer programming problems
- Ranking in quadratic integer programming problems
This page was built for publication: Ranking in integer programming with bounded variables.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2476433)
