scientific article; zbMATH DE number 2166303
From MaRDI portal
zbMath1060.90688MaRDI QIDQ4673630
John J. Jarvis, Mokhtar S. Bazaraa
Publication date: 6 May 2005
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
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
Local optima topology for the \(k\)-coloring problem, A subgradient-based optimization for reservois system management, A multiple objective programming approach to linear bilevel multi-follower programming, A nonlinear hierarchical approach for incorporating solar generation units in electric utility capacity expansion plans, An algorithm for optimal resource allocation in systems with linear constraints, Finite method for a nonlinear allocation problem, A transportation type aggregate production model with bounds on inventory and backordering, On the use of lexicographic min cost flows in evacuation modeling, A LINEAR BILEVEL PROGRAMMING PROBLEM FOR OBTAINING THE CLOSEST TARGETS AND MINIMUM DISTANCE OF A UNIT FROM THE STRONG EFFICIENT FRONTIER, An algorithm for solving fixed-charge problems using surrogate constraints, Network flow problems with one side constraint: A comparison of three solution methods, A heuristic solution procedure for multicommodity integer flows, A branch-and-bound algorithm for the transportation problem with location of \(p\) transshipment points, A Constructive Proof of the Representation Theorem for Polyhedral Sets Based on Fundamental Definitions, A strongly polynomial algorithm for a concave production-transportation problem with a fixed number of nonlinear variables, Handling organ motion in radiotherapy of cancer via Markov chains, Branch-and-price algorithm for fuzzy integer programming problems with block angular structure, Search-hide games on trees, Optimization of a linear function over an integer efficient set, A risk function for the stochastic modeling of electric capacity expansion, Minimal-cost network flow problems with variable lower bounds on arc flows, A comparison of interval linear programming with the simplex method, Canonical bases in linear programming, Replacing unification by constraint satisfaction to improve logic program expressiveness, Topology optimization of flow networks., The basis suppression method, Robust estimation of parametric membership regions, Biobjective sparse principal component analysis, Equivalent weights for lexicographic multi-objective programs: Characterizations and computations, New approach on robust and reliable decentralized \(H_\infty\) tracking control for fuzzy interconnected systems with time-varying delay, Bicriteria network flow problems: Continuous case, Necessary and sufficient conditions for the existence of complementary solutions and characterizations of the matrix classes \(Q\) and \(Q_ 0\), Decomposition algorithms for finding the shortest path between a source node and a sink node of a network, Finding strong defining hyperplanes of PPS using multiplier form, Time minimizing flows in directed networks, Strongly polynomial algorithm for a production-transportation problem with concave production cost, A simple algebraic proof of Farkas's lemma and related theorems, Delay-dependent robust and reliable \(H_\infty\) fuzzy hyperbolic decentralized control for uncertain nonlinear interconnected systems, A trust region algorithm via bilevel linear programming for solving the general multicommodity minimal cost flow problems, A nested benders decomposition approach for telecommunication network planning, The role of stochastic programming in communication network design, A product form representation of the inverse of a multicommodity cycle matrix, Primal transportation and transshipment algorithms, Flexible optimization of machining variables using constrained R-T characteristic curve, Finding non-dominated solutions in bi-objective integer network flow problems, A basis-defiency-allowing variation of the simplex method for linear programming, An integrated approach to the part selection and machine loading problem in a class of flexible manufacturing systems, A complete algorithm for linear fractional programs, Cumulative search-evasion games, Weak optimal inverse problems of interval linear programming based on KKT conditions, A labeling algorithm to solve the assignment problem, Decomposition algorithms for minimal cut problems, Optimum feedback patterns in multivariable control systems, The return plant location problem: Modelling and resolution, A Stochastic Flow Problem, Decomposition algorithms for locating minimal cuts in a network, The flow circulation sharing problem, A novel approach to robust parameter estimation using neurofuzzy systems, Stable and unstable numerical boundary conditions for Galerkin approximations to hyperbolic systems, Nonadjacent extreme point methods for solving linear programs, Réduction de la résolution d'un problème de réseau maillé (B) : sur la convergence locale de certaines méthodes, A decomposition algorithm for locating a shortest path between two nodes in a network, Algorithms for preemptive scheduling of different classes of processors to do jobs with fixed times, A case of non-convergent dual changes in assignment problems, Generalized characterization of tracking systems and linear multivariable plants, Synthesis of limit-tracking systems incorporating linear multivariable plants, Strongly polynomial algorithm for two special minimum concave cost network flow problems, Efficient enumeration of the vertices of polyhedra associated with network LP's, Optimizing over three-dimensional subspaces in an interior-point method for linear programming, Inference flexibility in Horn clause knowledge bases and the simplex method, Réduction de la résolution d'un problème de réseau maillé, A property regarding degenerate pivots for linear assignment networks
