Person:229626: Difference between revisions

From MaRDI portal
Person:229626
Created automatically from import230924090903
 
m AuthorDisambiguator moved page Ravindra K. Ahuja to Ravindra K. Ahuja: Duplicate
 
(No difference)

Latest revision as of 13:53, 9 December 2023

Available identifiers

zbMath Open ahuja.ravindra-kDBLP90/5559WikidataQ7296729 ScholiaQ7296729MaRDI QIDQ229626

List of research outcomes

PublicationDate of PublicationType
Hysteresis behavior and pyroelectric properties of multi-surface ferroelectric thin films2024-05-08Paper
https://portal.mardi4nfdi.de/entity/Q46359582018-04-23Paper
https://portal.mardi4nfdi.de/entity/Q46359592018-04-23Paper
https://portal.mardi4nfdi.de/entity/Q46359602018-04-23Paper
A Heuristic Approach to the Multi-Period Single-Sourcing Problem with Production and Inventory Capacities and Perishability Constraints2012-06-18Paper
A Very Large-Scale Neighborhood Search Algorithm for the Combined Through-Fleet-Assignment Model2012-06-18Paper
Very Large-Scale Neighborhood Search for the Quadratic Assignment Problem2012-06-18Paper
Solving the Convex Cost Integer Dual Network Flow Problem2012-02-19Paper
A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem2012-02-19Paper
Algorithms for the Simple Equal Flow Problem2012-02-12Paper
Single-machine scheduling with stepwise tardiness costs and release times2012-01-18Paper
Incremental Network Optimization: Theory and Algorithms2011-11-24Paper
Fast Algorithms for Specially Structured Minimum Cost Flow Problems with Applications2011-11-17Paper
Lower bounding techniques for the degree-constrained network design problem2010-11-24Paper
https://portal.mardi4nfdi.de/entity/Q30569482010-11-23Paper
A New Linear Programming Approach to Radiation Therapy Treatment Planning Problems2009-08-13Paper
Exact and Heuristic Algorithms for the Weapon-Target Assignment Problem2009-08-13Paper
TECHNICAL NOTE—Solving Linear Cost Dynamic Lot-Sizing Problems in O(n log n) Time2009-08-13Paper
Inverse Optimization2009-07-03Paper
A Fast Scaling Algorithm for Minimizing Separable Convex Functions Subject to Chain Constraints2009-07-03Paper
Neighborhood search approaches to beam orientation optimization in intensity modulated radiation therapy treatment planning2009-05-04Paper
Optimal network configuration and capacity expansion of railroads2008-08-14Paper
New approaches for solving the block‐to‐train assignment problem2008-01-08Paper
Very large-scale neighborhood search for the \(K\)-constraint multiple knapsack problem2006-05-29Paper
A Column Generation Approach to Radiation Therapy Treatment Planning Using Aperture Modulation2005-09-16Paper
A network flow algorithm to minimize beam‐on time for unconstrained multileaf collimator problems in cancer radiation therapy2005-02-23Paper
A neighborhood search algorithm for the combined through and fleet assignment model with time windows2005-01-12Paper
A cut-based algorithm for the nonlinear dual of the minimum cost network flow problem2004-12-13Paper
https://portal.mardi4nfdi.de/entity/Q44530032004-03-07Paper
Dynamic shortest paths minimizing travel times and costs2003-07-31Paper
Minimum Time and Minimum Cost-Path Problems in Street Networks with Periodic Traffic Lights2003-06-29Paper
A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem.2003-06-17Paper
A network simplex algorithm with O(\(n\)) consecutive degenerate pivots2003-04-02Paper
Combinatorial algorithms for inverse network flow problems2003-03-19Paper
A survey of very large-scale neighborhood search techniques2002-09-17Paper
Solving Inverse Spanning Tree Problems Through Network Flow Techniques2002-02-07Paper
New polynomial-time cycle-canceling algorithms for minimum-cost flows2001-10-04Paper
A Faster Algorithm for the Inverse Spanning Tree Problem2001-09-10Paper
Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem2001-01-01Paper
A greedy genetic algorithm for the quadratic assignment problem2000-09-04Paper
The balanced linear programming problem2000-01-18Paper
https://portal.mardi4nfdi.de/entity/Q42637001999-09-22Paper
Diagnosing infeasibilities in network flow problems1999-09-05Paper
Computational investigations of maximum flow algorithms1999-02-22Paper
A polynomial-time algorithm for message routing in hierarchical communication networks1998-11-05Paper
Optimal expansion of capacitated transshipment networks1998-10-07Paper
https://portal.mardi4nfdi.de/entity/Q43983741998-07-19Paper
A new pivot selection rule for the network simplex algorithm1998-06-22Paper
Equivalence of the primal and dual simplex algorithms for the maximum flow problem1997-08-05Paper
Use of Representative Operation Counts in Computational Testing of Algorithms1997-05-20Paper
Improved Algorithms for Bipartite Network Flow1996-07-04Paper
A capacity scaling algorithm for the constrained maximum flow problem1995-09-27Paper
New scaling algorithms for the assignment and minimum mean cycle problems1992-09-26Paper
Finding minimum-cost flows by double scaling1992-06-28Paper
The Scaling Network Simplex Algorithm1992-06-28Paper
Some Recent Advances in Network Flows1991-01-01Paper
Distance-directed augmenting path algorithms for maximum flow and parametric maximum flow problems1991-01-01Paper
Faster algorithms for the shortest path problem1990-01-01Paper
A Fast and Simple Algorithm for the Maximum Flow Problem1989-01-01Paper
Improved Time Bounds for the Maximum Flow Problem1989-01-01Paper
Minimum cost-reliability ratio path problem1988-01-01Paper
Exact and Heuristic Algorithms for the Optimum Communication Spanning Tree Problem1987-01-01Paper
New lower planes for the network design problem1987-01-01Paper
Algorithms for the minimax transportation problem1986-01-01Paper
Minimax linear programming problem1985-01-01Paper
A parametric algorithm for convex cost network flow and related problems1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36666141983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47504271983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39123671981-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Ravindra K. Ahuja