scientific article
From MaRDI portal
Publication:3323698
zbMath0537.90067MaRDI QIDQ3323698
Publication date: 1983
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
perturbation techniquessensitivity analysisinventorydualityDantzig-Wolfe decompositionsystems of linear equationscutting stocktriangular factorizationparametric linear programmingbest approximate solutionspeeds of convergenceSimplex Methodtransshipment problemsconvex polyhedral set of feasible pointscycling avoidanceellipsoidal methodGeneralized upper boundingKhachiyan algorithmmaximum flow programsprimal- dual methodtheorem on doubly stochastic matricesUpper bound problems
Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Linear programming (90C05) 2-person games (91A05) Deterministic scheduling theory in operations research (90B35) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Deterministic network models in operations research (90B10) Inventory, storage, reservoirs (90B05) Iterative numerical methods for linear systems (65F10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Stochastic matrices (15B51) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to calculus of variations and optimal control (49-01)
Related Items
On point-duration networks for temporal reasoning, Constraint programming and operations research, Robust vertex enumeration for convex hulls in high dimensions, \texttt{mplrs}: a scalable parallel vertex/facet enumeration code, A quantitative approach to belief revision in structured probabilistic argumentation, Globally optimal clusterwise regression by column generation enhanced with heuristics, sequencing and ending subset optimization, Objects that cannot be taken apart with two hands, An extension of Karmarkar's algorithm for linear programming using dual variables, Strong linear independence in bottleneck algebra, The feasibility of general task systems with precedence constraints on multiprocessor platforms, A Z-simplex algorithm with partial updates, Enumeration of Nash equilibria for two-player games, Enumerative techniques for solving some nonconvex global optimization problems, A column-and-cut generation algorithm for planning of Canadian armed forces tactical logistics distribution, A \texttt{cost-regular} based hybrid column generation approach, Simplices by point-sliding and the Yamnitsky-Levin algorithm, Determining basic variables of optimal solutions in Karmarkar's new LP algorithm, A linear-time algorithm for linear \(L_ 1\) approximation of points, Sequence-based analysis of metabolic demands for protein synthesis in prokaryotes, Packing and covering tetrahedra, Addendum to ``Recursively defined metric spaces without contraction, On ``pre-historic linear programming and the figure of the Earth, A double oracle approach to minmax regret optimization problems with interval data, Equality detection for linear arithmetic constraints, Minimizing the number of independent sets in triangle-free regular graphs, Learning to compete, coordinate, and cooperate in repeated games using reinforcement learning, The representation polyhedron of a semiorder., A convergent simplicial algorithm with \(\omega \)-subdivision and \(\omega \)-bisection strategies, Computing multiple-output regression quantile regions, Boundary modeling in model-based calibration for automotive engines via the vertex representation of the convex hulls, First-order automated reasoning with theories: when deduction modulo theory meets practice, A least-squares minimum-cost network flow algorithm, Stochastic separated continuous conic programming: strong duality and a solution method, An exploratory computational analysis of dual degeneracy in mixed-integer programming, Closed formulas in local sensitivity analysis for some classes of linear and non-linear problems, Unique sink orientations of grids, An algorithmic separating hyperplane theorem and its applications, \(\ell^ 1\)-optimal control of multivariable systems with output norm constraints, Computing solutions of the multiclass network equilibrium problem with affine cost functions, Reduced first-level representations via the reformulation-linearization technique: Results, counterexamples, and computations, The translation square map and approximate congruence, Quantitative Steinitz's theorems with applications to multifingered grasping, Exponentiality of the exchange algorithm for finding another room-partitioning, The maximum number of second smallest distances in finite planar sets, Generalized probabilistic satisfiability, An exponential lower bound for Cunningham's rule, A gradual facilitate high-order multivariate Markov chains model with application to the changes of exchange rates in Egypt: new approach, Maximum concurrent flows and minimum cuts, On the solution uniqueness characterization in the L1 norm and polyhedral gauge recovery, Integrating column generation in a method to compute a discrete representation of the non-dominated set of multi-objective linear programmes, On the extreme points of a family of matrices related to a theorem of Birkhoff, A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra, A parametric successive underestimation method for convex multiplicative programming problems, A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method, An algorithm to compute the nucleolus of shortest path games, Reasoning about qualitative temporal information, Probabilization of logics: completeness and decidability, Comparative analysis of pattern-based models for the two-dimensional two-stage guillotine cutting stock problem, On robust online scheduling algorithms, Congestion control for a system with parallel stations and homogeneous customers using priority passes, Necessary and sufficient conditions of solution uniqueness in 1-norm minimization, Optimal assignment schemes for general access structures based on linear programming, Facets of the cone of totally balanced games, The decision rule approach to optimization under uncertainty: methodology and applications, A first look at picking dual variables for maximizing reduced cost fixing, Scheduling internal audit activities: a stochastic combinatorial optimization problem, On the performance evaluation of multi-guarded marked graphs with single-server semantics, A new ranking method to fuzzy data envelopment analysis, Merging the local and global approaches to probabilistic satisfiability, A modification of Karmarkar's linear programming algorithm, The complexity of satisfiability in non-iterated and iterated probabilistic logics, A modified simplicial algorithm for convex maximization based on an extension of \(\omega \)-subdivision, Computing Kitahara-Mizuno's bound on the number of basic feasible solutions generated with the simplex algorithm, Finiteness of the quadratic primal simplex method when \(\mathbf s\)-monotone index selection rules are applied, Equilibrium relations in a capital asset market: A mean absolute deviation approach, A constrained least square approach to the estimation of the term structure of interest rates, Kernel classification using a linear programming approach, A solution framework for linear PDE-constrained mixed-integer problems, An objective general index for multivariate ordered data, The conditional \(p\)-dispersion problem, The sparse signomial classification and regression model, Solving interval linear systems with linear programming techniques, Computing monotone disjoint paths on polytopes, Time-adaptive quantile regression, The dual polyhedron to the chordal graph polytope and the rebuttal of the chordal graph conjecture, Fast quantum subroutines for the simplex method, A triangulation and fill-reducing initialization procedure for the simplex algorithm, Network disconnection games: a game theoretic approach to checkpoint evaluation in networks, Heuristic and exact algorithms for the simultaneous assignment problem, Discrete convex analysis, Zonotopes with large 2D-cuts, An exact approach to extend network lifetime in a general class of wireless sensor networks, A data structure for dynamic trees, The convex hull of degree sequences of signed graphs, An exact projection-based algorithm for bilevel mixed-integer problems with nonlinearities, Bounds for probabilistic integer programming problems, Degeneracy graphs: Theory and applications. An updated survey, An \(L_{1}\) estimation algorithm with degeneracy and linear constraints., Non-linear evolution using optimal fourth-order strong-stability-preserving Runge-Kutta methods, Spectral simplex method, The multiple trip vehicle routing problem with backhauls in random fuzzy environment: using (α,β)-cost minimization model under the Hurwicz criterion, Algorithm 1024: Spherical Triangle Algorithm: A Fast Oracle for Convex Hull Membership Queries, A pivoting algorithm for linear programming with linear complementarity constraints, Unnamed Item, Computing on Lattice-Ordered Abelian Groups, The story of perfectly orderable graphs, Classification of companies using maximal margin ellipsoidal surfaces, Intrinsic formulation and Lagrange duality for elastic cable networks with geometrical nonlinearity, Space-sweep algorithms for parametric optimization, Fuzzy facility location-allocation problem under the Hurwicz criterion, Geometric and algebraic reduction for singular momentum maps, The interior-point revolution in optimization: History, recent developments, and lasting consequences, On the Hull of the Solution Sets of Interval Linear Equations, On routing and scheduling a fleet of resource-constrained vessels to provide ongoing continuous patrol coverage, Maximum flows in parametric graph templates, A novel high-order multivariate Markov model for spatiotemporal analysis with application to COVID-19 outbreak, Semidefinite programming and its applications to NP problems, Revisiting degeneracy, strict feasibility, stability, in linear programming, Generalized probabilistic satisfiability and applications to modelling attackers with side-channel capabilities, Facility location-allocation problem in random fuzzy environment: using \((\alpha,\beta )\)-cost minimization model under the Hurewicz criterion, On a computationally ill-behaved bilevel problem with a continuous and nonconvex lower level, The maximin support method: an extension of the d'Hondt method to approval-based multiwinner elections, Permutations in the Factorization of Simplex Bases, Linear programming problems on time scales, Globally tight bounds for almost differentiable functions over polytopes with application to tolerance analysis., A simplicial branch-and-bound algorithm conscious of special structures in concave minimization problems, A bijection between the \(d\)-dimensional simplices with distances in \(\{1,2\}\) and the partitions of \(d+1\), Unnamed Item, Alternative integer-linear-programming formulations of the Clar problem in hexagonal systems, A branch-and-bound algorithm for solving a fixed charge problem in the profit optimization of sawn timber production, Computing Closest Stable Nonnegative Matrix, On the vertices of the \(k\)-additive core, Column-Generation in Integer Linear Programming, Enumerating Vertices of Covering Polyhedra with Totally Unimodular Constraint Matrices, A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem, Rigorous solution of linear programming problems with uncertain data, Codegree Conditions for Tiling Complete k-Partite k-Graphs and Loose Cycles, Generating all vertices of a polyhedron is hard, Graphs and Algorithms in Communication Networks on Seven League Boots, On the complexity of inconsistency measurement, Template polyhedra and bilinear optimization, Computing Feasible Points of Bilevel Problems with a Penalty Alternating Direction Method, The design of optimum component test plans in the demonstration of a series system reliability, Enumerating Vertices of 0/1-Polyhedra associated with 0/1-Totally Unimodular Matrices, Optimization of a long-short portfolio under nonconvex transaction cost, A characterization theorem and an algorithm for a convex hull problem, Backdoors to tractable answer set programming
