Munish C. Puri

From MaRDI portal
Revision as of 08:44, 6 October 2023 by Import231006081045 (talk | contribs) (Created automatically from import231006081045)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:1769947

Available identifiers

zbMath Open puri.munish-cWikidataQ6936677 ScholiaQ6936677MaRDI QIDQ1769947

List of research outcomes





PublicationDate of PublicationType
Bilevel time minimizing transportation problem2008-11-19Paper
A lexi-search algorithm for a time minimizing assignment problem.2008-01-25Paper
Minimization of makespan in generalized assignment problem.2008-01-25Paper
Bilevel time minimizing assignment problem2007-02-19Paper
On critical capacity of arcs in a directed network2006-12-07Paper
Max-min sum minimization transportation problem2006-10-11Paper
Two level hierarchical time minimizing transportation problem2005-04-04Paper
Bicriteria integer quadratic programming problems2002-06-05Paper
A variant of time minimizing assignment problem2000-11-12Paper
A branch and bound procedure for cost minimizing bulk transportation problem1999-04-11Paper
Ranking in quadratic integer programming problems1999-02-22Paper
https://portal.mardi4nfdi.de/entity/Q42214641999-01-03Paper
A bilevel bottleneck programming problem1998-07-14Paper
https://portal.mardi4nfdi.de/entity/Q43496401997-08-24Paper
Time-cost Trade-off Relations in Bulk Transportation Problem1996-12-08Paper
On ranking of feasible solutions of a bottleneck linear programming problem1996-08-01Paper
https://portal.mardi4nfdi.de/entity/Q48871431996-08-01Paper
On bilevel fractional programming1996-01-07Paper
Extreme point quadratic fractional programming problem1995-08-17Paper
“More(Same)-for-Less” Paradox In Minimal Cost Network Flow Problem1995-06-21Paper
Maximizing pseudoconvex transportation problem: A special type1995-06-01Paper
Bicriteria bottleneck linear programming problem1995-04-20Paper
A paradox in linear fractional transportation problems with mixed constraints1995-04-20Paper
A bilevel linear programming problem with bottleneck objectives1995-01-15Paper
https://portal.mardi4nfdi.de/entity/Q43033731994-08-25Paper
https://portal.mardi4nfdi.de/entity/Q31424471993-12-12Paper
https://portal.mardi4nfdi.de/entity/Q31424501993-12-12Paper
Extreme point Quadratic Minimization Problem1993-12-06Paper
https://portal.mardi4nfdi.de/entity/Q52859691993-06-29Paper
https://portal.mardi4nfdi.de/entity/Q39768911992-06-25Paper
On Wolf's method for solving linear fractional programming problem1990-01-01Paper
Ranking in integer linear fractional programming problems1990-01-01Paper
Some special situations in linear fractional programming problem: An algorithmic comparison1989-01-01Paper
On Martos' and Chaehes-Coopeb's approach vis-a-vis1989-01-01Paper
Multi-Index Transportation Problem with mixed type of Axial Constraints1988-01-01Paper
Impaired flow multi-index transportation problem with axial constraints1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38158591988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37838581987-01-01Paper
The three dimensional bottleneck assignment problem and its variants1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33152391984-01-01Paper
Solving a transportation problem with mixed constraints and a specified transportation flow1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33372181983-01-01Paper
Bi-criteria assignment problem1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47425681982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39123651981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39123661981-01-01Paper
A study of cost variations in extreme point mathematical programming problems1980-01-01Paper
A min max problem1980-01-01Paper
Ranking assignments in order of increasing completion time1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39551581980-01-01Paper
A note on the min max problem in geometric programming1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38519771979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38658381979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41890421979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39050641978-01-01Paper
The set covering problem with linear fractional functional1977-01-01Paper
A procedure for time minimization transportation problem1977-01-01Paper
Enumeration Technique for the Set Covering Problem with a Linear Fractional Functional as its Objective Function1977-01-01Paper
Time-Cost Trade-Off in a Solid Transportation Problem1977-01-01Paper
Cutting Plane Technique for the Set Covering Problem with Linear Fractional Functional1977-01-01Paper
Time minimizing solid transportation problem1976-01-01Paper
Strong-cut cutting plane procedure for extreme point mathematical programming problems1975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40653111975-01-01Paper
Simple enumerative method for fixed charge problem1974-01-01Paper
A systematic extreme point enumeration procedure for fixed charge problem1974-01-01Paper
Extreme point linear fractional functional programming1974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56717971973-01-01Paper
Strong-Cut Enumerative procedure for Extreme point Mathematical Programming Problems1973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56786761973-01-01Paper

Research outcomes over time

This page was built for person: Munish C. Puri