scientific article; zbMATH DE number 3854804
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)
- 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
- Probabilization of logics: completeness and decidability
- A first look at picking dual variables for maximizing reduced cost fixing
- The multiple trip vehicle routing problem with backhauls in random fuzzy environment: using \((\alpha,\beta)\)-cost minimization model under the Hurwicz criterion
- 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
- A linear-time algorithm for linear \(L_ 1\) approximation of points
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
- Minimizing the number of independent sets in triangle-free regular graphs
- Generating all vertices of a polyhedron is hard
- scientific article; zbMATH DE number 4130564 (Why is no real title available?)
- A gradual facilitate high-order multivariate Markov chains model with application to the changes of exchange rates in Egypt: new approach
- A convergent simplicial algorithm with -subdivision and -bisection strategies
- 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
- scientific article; zbMATH DE number 1786124 (Why is no real title available?)
- Computing on Lattice-Ordered Abelian Groups
- A modification of Karmarkar's linear programming algorithm
- A \texttt{cost-regular} based hybrid column generation approach
- Heuristic and exact algorithms for the simultaneous assignment problem
- On the extreme points of a family of matrices related to a theorem of Birkhoff
- Reasoning about qualitative temporal information
- On the hull of the solution sets of interval linear equations
- Intrinsic formulation and Lagrange duality for elastic cable networks with geometrical nonlinearity
- scientific article; zbMATH DE number 5641435 (Why is no real title available?)
- First-order automated reasoning with theories: when deduction modulo theory meets practice
- Coisotropic invariant tori of hamiltonian systems of the quasiclassical theory of motion of a conduction electron
- A data structure for dynamic trees
- Template polyhedra and bilinear optimization
- Time-adaptive quantile regression
- Column-Generation in Integer Linear Programming
- The interior-point revolution in optimization: History, recent developments, and lasting consequences
- scientific article; zbMATH DE number 195106 (Why is no real title available?)
- Enumerating vertices of covering polyhedra with totally unimodular constraint matrices
- An extension of Karmarkar's algorithm for linear programming using dual variables
- Computing monotone disjoint paths on polytopes
- The translation square map and approximate congruence
- Degeneracy graphs: Theory and applications. An updated survey
- Equilibrium relations in a capital asset market: A mean absolute deviation approach
- Zonotopes with large 2D-cuts
- scientific article; zbMATH DE number 2132174 (Why is no real title available?)
- On the complexity of inconsistency measurement
- Enumeration of Nash equilibria for two-player games
- The story of perfectly orderable graphs
- Graphs and algorithms in communication networks on seven league boots
- The complexity of satisfiability in non-iterated and iterated probabilistic logics
- Unique sink orientations of grids
- Merging the local and global approaches to probabilistic satisfiability
- A solution framework for linear PDE-constrained mixed-integer problems
- A triangulation and fill-reducing initialization procedure for the simplex algorithm
- Discrete convex analysis
- On the vertices of the \(k\)-additive core
- Equality detection for linear arithmetic constraints
- A parametric successive underestimation method for convex multiplicative programming problems
- A column-and-cut generation algorithm for planning of Canadian armed forces tactical logistics distribution
- Reduced first-level representations via the reformulation-linearization technique: Results, counterexamples, and computations
- Geometric and algebraic reduction for singular momentum maps
- Finiteness of the quadratic primal simplex method when \(\mathbf s\)-monotone index selection rules are applied
- Alternative integer-linear-programming formulations of the Clar problem in hexagonal systems
- The conditional \(p\)-dispersion problem
- Globally tight bounds for almost differentiable functions over polytopes with application to tolerance analysis.
- Linear programming problems on time scales
- A novel high-order multivariate Markov model for spatiotemporal analysis with application to COVID-19 outbreak
- Optimal assignment schemes for general access structures based on linear programming
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)