scientific article
From MaRDI portal
Publication:3998396
zbMath0722.90042MaRDI QIDQ3998396
Hanif D. Sherali, John J. Jarvis, Mokhtar S. Bazaraa
Publication date: 17 September 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Linear programming (90C05) Deterministic network models in operations research (90B10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)
Related Items
Minimum cost multicommodity network flow problem in time-varying networks: by decomposition principle, On the structural properties of a discrete-time single product revenue management problem, A sequential-design metamodeling strategy for simulation optimization, Fractional multi-commodity flow problem: duality and optimality conditions, Generalized minimal cost flow problem in fuzzy nature: an application in bus network planning problem, Exact null distributions of distribution-free quadratic \(t\)-sample statistics, Solving a class of multiplicative programming problems via \(C\)- programming, Dual cone approach to convex-cone dominance in multiple criteria decision making, Fuzzy goal programming: complementary slackness conditions and computational schemes, Duality in fuzzy number linear programming by use of a certain linear ranking function, Applied cost allocation: the DEA-Aumann-Shapley approach, A dual-based algorithm for solving lexicographic multiple objective programs, Max-min matching problems with multiple assignments, Computational and theoretical pitfalls in some current performance measurement techniques; and a new approach, GNU Oflox: an academic software for the minimal cost network flow problem, Solving fully fuzzy matrix equations, Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem, Optimality and bias of some interpolation and extrapolation designs, A polynomial-time algorithm to estimate returns to scale in FDH models, Continuous modular design problem: analysis and solution algorithms, Multiresolution analysis applied to the Monge-Kantorovich problem, Reliable overlay multicast trees for private internet broadcasting with multiple sessions, Efficient parallel algorithms for the minimum cost flow problem, Cost efficiency with triangular fuzzy number input prices: an application of DEA, Optimizing dead mileage in urban bus routes through a nondominated solution approach, A heuristic method for the minimum toll booth problem, A super-efficiency model for ranking efficient units in data envelopment analysis, Exact decomposition approaches for Markov decision processes: a survey, Avoiding unfairness of \textit{Owen} allocations in linear production processes, Finding weak defining hyperplanes of PPS of the BCC model, Sensitivity analysis on the priority of the objective functions in lexicographic multiple objective linear programs, Interdicting the activities of a linear program -- a parametric analysis, Approximate stochastic dynamic programming for hydroelectric production planning, Computational evaluation of multi-iterative approaches for solving graph-structured large linear systems, Distance functions for matching in small samples, Ratio-based RTS determination in weight-restricted DEA models, Network simplex algorithm for the general equal flow problem., Solve least absolute value regression problems using modified goal programming techniques., A capable neural network model for solving the maximum flow problem, Linear bilevel programming with interval coefficients, On inverse linear programming problems under the bottleneck-type weighted Hamming distance, An enumerative algorithm for computing all possibly optimal solutions to an interval LP, Convexification of generalized network flow problem, An introduction to dynamic generative networks: minimum cost flow, A labeling algorithm for the fuzzy assignment problem., Finding a weights-restricted efficient (extreme) point and using it for solving MOLP problems., Artificial-free simplex algorithm based on the non-acute constraint relaxation, Load capacity ratios for structures, A geometric approach for solving fuzzy linear programming problems, Personnel placement in a fuzzy environment, Accelerated multigrid for graph Laplacian operators, Row-stochastic matrices with a common left fixed vector, Processing time-dependent shortest path queries without pre-computed speed information on road networks, Cost allocation and convex data envelopment, Efficient solutions for the bicriteria network flow problem, A specialized network simplex algorithm for the constrained maximum flow problem, A bisection-extreme point search algorithm for optimizing over the efficient set in the linear dependence case, An effective computational attempt in DDEA, Inverse problems and solution methods for a class of nonlinear complementarity problems, Estimation of an optimal solution of a LP problem with unknown objective function, A warm-start dual simplex solution algorithm for the minimum flow networks with postoptimality analyses, Efficiency analysis, generating an efficient extreme point for an MOLP, and some comparisons, On FDH efficiency analysis with interval data, The sagitta method for solving linear programs, A travel demand management strategy: the downtown space reservation system, An efficient Lagrangean heuristic for rental vehicle scheduling, An extended shortest path problem: a data envelopment analysis approach, Maximum flow problem on dynamic generative network flows with time-varying bounds, Improved immune algorithm for global numerical optimization and job-shop scheduling problems, A dual simplex-based method for determination of the right and left returns to scale in DEA, Extending linear relaxation for non-square matrices and soft constraints, Dorn's duality for quadratic programs revisited: The nonconvex case, A transportation model with multiple criteria and multiple constraint levels, Courtship and linear programming, Manpower allocation using genetic annealing, A decomposition approach for the probabilistic maximal covering location-allocation problem, Computation of the collapse state in limit analysis using the LP primal affine scaling algorithm, Determining maximal efficient faces in multiobjective linear programming problem, A fuzzy shortest path with the highest reliability, Solving systems of nonlinear equations with continuous GRASP, Price-directive decomposition applied to routing in telecommunication networks, Cost efficiency measures in data envelopment analysis with data uncertainty, Modeling cooperation on a class of distribution problems, Complete solutions of multiple objective transportation problems with possibilistic coefficients, Joint planning of combined heat and power and electric power systems: An efficient model formulation, An efficient neural network for solving convex optimization problems with a nonlinear complementarity problem function, A mathematical programming viewpoint for solving the ultimate pit problem, Optimal system design with MC\(^2\) linear programming: A dual contingency plan approach, Fast collision detection in four-dimensional space, Restricting weights in value efficiency analysis., Extensions of Dinkelbach's algorithm for solving nonlinear fractional programming problems, Algorithms for a multi-level network optimization problem, A theory of complexity for continuous time systems, The simplex method as a global optimizer: A \(C\)-programming perspective, The fuzzy shortest path problem and its most vital arcs, The single most vital arc in the most economical path problem -- a parametric analysis, A comment regarding polynomial discriminant functions, A least-squares primal-dual algorithm for solving linear programming problems, Dynamic shortest path in stochastic dynamic networks: Ship routing problem, A simplex approach for finding local solutions of a linear bilevel program by equilibrium points, Decomposition techniques for the minimum toll revenue problem, Reliability assessment of granular filters in embankment dams, Flexible contingency plans in optimal linear designs, Multiobjective transportation network design and routing problems: Taxonomy and annotation, Descent direction algorithm with multicommodity flow problem for signal optimization and traffic assignment jointly, On the computational complexity of cost efficiency analysis models, Control system design by using a multi-controller approach with a real-time experimentation for a robot wrist, Cost efficiency analysis with ordinal data: a theoretical and computational view, Solving generalized transportation problems via pure transportation problems, Unnamed Item, An alternative approach in the estimation of returns to scale under weight restrictions, On dependent randomized rounding algorithms, Sensitivity analysis of efficient units in the presence of non-discretionary inputs, A survey of combinatorial optimization problems in multicast routing, An improved initial basis for the simplex algorithm, DEGENERACY IN FUZZY LINEAR PROGRAMMING AND ITS APPLICATION, A PENALTY METHOD FOR SOLVING BILEVEL LINEAR FRACTIONAL/LINEAR PROGRAMMING PROBLEMS, A branch‐and‐bound algorithm for representative integer efficient solutions in multiple objective network programming problems, Dual contingency plans in optimal generalized linear designs, A column generation method for inverse shortest path problems, Discrete equal-capacityp-median problem, Unnamed Item, Solving biobjective network flow problem associated with minimum cost-time loading, Generalized max flows and augmenting paths, MAXIMIZING THE THROUGHPUT OF TANDEM LINES WITH FLEXIBLE FAILURE-PRONE SERVERS AND FINITE BUFFERS, An enumerative algorithm for solving nonconvex dynamic DEA models, Employing the cloud for finding solutions to large systems of nonlinear equations, A new method for ranking non-extreme efficient units in data envelopment analysis, Robust optimization for minimizing energy consumption of multicast transmissions in coded wireless packet networks under distance uncertainty, Determining the optimal flows in zero-time dynamic networks, Solution of preemptive multi-objective network design problems applying Benders decomposition method, Transporting and Mixing Gasses with Different Qualities, An extension to the single bottleneck transportation problem, Transporting and Mixing Gasses with Different Qualities, Importance measures in reliability and mathematical programming, A self-stabilizing algorithm for the maximum flow problem, An interactive approach for solving the multiobjective minimum cost flow problem in the fuzzy environment, A direct heuristic algorithm for linear programming, On some multiobjective optimization problems arising in biology, The big-M method with the numerical infinite \(M\), COMPILE TIME PARTITIONING OF NESTED LOOP ITERATION SPACES WITH NON-UNIFORM DEPENDENCES*, Global variation of outputs with respect to the variation of inputs in performance analysis; generalized RTS, A neurodynamic approach to zero-one quadratic programming, Methods for operations planning in airport decision support systems, EFFECTIVE PARALLELIZATION TECHNIQUES FOR LOOP NESTS WITH NON-UNIFORM DEPENDENCES, Optimal and strongly optimal solutions for linear programming models with variable parameters, Sensitivity analysis in interval-valued trapezoidal fuzzy number linear programming problems, Solving rank one revised linear systems by the scaled ABS method, A simple algebraic proof of Farkas's lemma and related theorems, Methods for operations planning in airport decision support systems, Identification of fuzzy measures from sample data with genetic algorithms, Numerical solution of fuzzy max-min systems, Fractional programming approach to fuzzy weighted average., A polyhedral study of the generalized vertex packing problem, Linear transformations to decrease computational requirements of solving some known linear programming models, Combinatorial algorithms for the minimum interval cost flow problem, Adjacency on the order polytope with applications to the theory of fuzzy measures, Multiple objective programming with piecewise linear functions, Non-Archimedean zero-sum games, Some new results on the algebraic characterizations of an equality constrained optimization problem equivalent to the transportation problem, Extreme points of some families of non-additive measures, Unnamed Item, Computational methods for solving fully fuzzy linear systems, A graph theory approach for designing conservation reserve networks with minimal fragmentation, Rejoinder, Identifying the anchor points in DEA using sensitivity analysis in linear programming, Sistema imunológico artificial para resolver o problema da árvore geradora mínima com parâmetros fuzzy, Modified greedy heuristic for the one-dimensional cutting stock problem, Vector Space Decomposition for Solving Large-Scale Linear Programs, Finding integer efficient solutions for multiple objective network programming problems, Construction and algebraic characterizations of a planar four-index transportation problem equivalent to a circularization network flow problem, Distributionally robust maximum probability shortest path problem, Stochastic Algorithms for the Estimation of an Optimal Solution of a LP Problem. Convergence and Central Limit Theorem, The role of hyperplanes for characterizing suspicious units in DEA, Multicriteria scheduling, A fuzzy set-based approach to origin-destination matrix estimation in urban traffic networks with imprecise data