scientific article; zbMATH DE number 3854804
From MaRDI portal
Publication:3323698
sensitivity analysisdualityinventoryperturbation techniquescutting stockDantzig-Wolfe decompositionsystems of linear equationstriangular 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
Numerical mathematical programming methods (65K05) Linear programming (90C05) Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Deterministic network models in operations research (90B10) Deterministic scheduling theory in operations research (90B35) Iterative numerical methods for linear systems (65F10) 2-person games (91A05) Stochastic matrices (15B51) Inventory, storage, reservoirs (90B05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to calculus of variations and optimal control (49-01)
Recommendations
Cited in
(only showing first 100 items - show all)- Closed formulas in local sensitivity analysis for some classes of linear and non-linear problems
- \(\ell^ 1\)-optimal control of multivariable systems with output norm constraints
- Understanding and using linear programming
- Facility location-allocation problem in random fuzzy environment: using \((\alpha,\beta )\)-cost minimization model under the Hurewicz criterion
- On routing and scheduling a fleet of resource-constrained vessels to provide ongoing continuous patrol coverage
- The dual polyhedron to the chordal graph polytope and the rebuttal of the chordal graph conjecture
- Fast quantum subroutines for the simplex method
- The representation polyhedron of a semiorder.
- A new ranking method to fuzzy data envelopment analysis
- scientific article; zbMATH DE number 2156369 (Why is no real title available?)
- A double oracle approach to minmax regret optimization problems with interval data
- On ``pre-historic linear programming and the figure of the Earth
- The convex hull of degree sequences of signed graphs
- A simplicial branch-and-bound algorithm conscious of special structures in concave minimization problems
- Sequence-based analysis of metabolic demands for protein synthesis in prokaryotes
- A Z-simplex algorithm with partial updates
- A least-squares minimum-cost network flow algorithm
- Exponentiality of the exchange algorithm for finding another room-partitioning
- Network disconnection games: a game theoretic approach to checkpoint evaluation in networks
- Kernel classification using a linear programming approach
- The design of optimum component test plans in the demonstration of a series system reliability
- An exact approach to extend network lifetime in a general class of wireless sensor networks
- Backdoors to tractable answer set programming
- Semidefinite programming and its applications to NP problems
- scientific article; zbMATH DE number 513105 (Why is no real title available?)
- A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem
- The many facets of linear programming
- Bounds for probabilistic integer programming problems
- Maximum concurrent flows and minimum cuts
- Congestion control for a system with parallel stations and homogeneous customers using priority passes
- Algorithm 1024: Spherical Triangle Algorithm: A Fast Oracle for Convex Hull Membership Queries
- Maximum flows in parametric graph templates
- Revisiting degeneracy, strict feasibility, stability, in linear programming
- Space-sweep algorithms for parametric optimization
- Permutations in the Factorization of Simplex Bases
- Codegree conditions for tiling complete \(k\)-partite \(k\)-graphs and loose cycles
- Fuzzy facility location-allocation problem under the Hurwicz criterion
- An exponential lower bound for Cunningham's rule
- On the solution uniqueness characterization in the L1 norm and polyhedral gauge recovery
- Boundary modeling in model-based calibration for automotive engines via the vertex representation of the convex hulls
- An \(L_{1}\) estimation algorithm with degeneracy and linear constraints.
- Simplices by point-sliding and the Yamnitsky-Levin algorithm
- scientific article; zbMATH DE number 50649 (Why is no real title available?)
- scientific article; zbMATH DE number 3934758 (Why is no real title available?)
- An exact projection-based algorithm for bilevel mixed-integer problems with nonlinearities
- \texttt{mplrs}: a scalable parallel vertex/facet enumeration code
- An objective general index for multivariate ordered data
- On a computationally ill-behaved bilevel problem with a continuous and nonconvex lower level
- A characterization theorem and an algorithm for a convex hull problem
- The decision rule approach to optimization under uncertainty: methodology and applications
- Linear programming
- Generalized probabilistic satisfiability
- Comparative analysis of pattern-based models for the two-dimensional two-stage guillotine cutting stock problem
- Packing and covering tetrahedra
- Enumerative techniques for solving some nonconvex global optimization problems
- Computing Closest Stable Nonnegative Matrix
- Facets of the cone of totally balanced games
- Integrating column generation in a method to compute a discrete representation of the non-dominated set of multi-objective linear programmes
- Generalized probabilistic satisfiability and applications to modelling attackers with side-channel capabilities
- The maximin support method: an extension of the d'Hondt method to approval-based multiwinner elections
- Linear Programming Isn't Always the Answer
- A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method
- Stochastic separated continuous conic programming: strong duality and a solution method
- Addendum to ``Recursively defined metric spaces without contraction
- Non-linear evolution using optimal fourth-order strong-stability-preserving Runge-Kutta methods
- Rigorous solution of linear programming problems with uncertain data
- The sparse signomial classification and regression model
- Computing Feasible Points of Bilevel Problems with a Penalty Alternating Direction Method
- Spectral simplex method
- Computing multiple-output regression quantile regions
- An algorithmic separating hyperplane theorem and its applications
- Quantitative Steinitz's theorems with applications to multifingered grasping
- Robust vertex enumeration for convex hulls in high dimensions
- Strong linear independence in bottleneck algebra
- Automatic synthesis of parallel algorithms
- Probabilistic temporal logic with countably additive semantics
- scientific article; zbMATH DE number 978851 (Why is no real title available?)
- A pivoting algorithm for linear programming with linear complementarity constraints
- Computing solutions of the multiclass network equilibrium problem with affine cost functions
- Solving interval linear systems with linear programming techniques
- On point-duration networks for temporal reasoning
- A bijection between the \(d\)-dimensional simplices with distances in \(\{1,2\}\) and the partitions of \(d+1\)
- On robust online scheduling algorithms
- An exploratory computational analysis of dual degeneracy in mixed-integer programming
- A robust optimization method with successive linear programming for intensity-modulated radiation therapy
- Objects that cannot be taken apart with two hands
- The maximum number of second smallest distances in finite planar sets
- Optimization of a long-short portfolio under nonconvex transaction cost
- Determining basic variables of optimal solutions in Karmarkar's new LP algorithm
- Constraint programming and operations research
- A branch-and-bound algorithm for solving a fixed charge problem in the profit optimization of sawn timber production
- An algorithm to compute the nucleolus of shortest path games
- Learning to compete, coordinate, and cooperate in repeated games using reinforcement learning
- The feasibility of general task systems with precedence constraints on multiprocessor platforms
- Scheduling internal audit activities: a stochastic combinatorial optimization problem
- On the performance evaluation of multi-guarded marked graphs with single-server semantics
- Necessary and sufficient conditions of solution uniqueness in 1-norm minimization
- Enumerating vertices of \(0/1\)-polyhedra associated with \(0/1\)-totally unimodular matrices
- A constrained least square approach to the estimation of the term structure of interest rates
- Classification of companies using maximal margin ellipsoidal surfaces
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3323698)
