scientific article; zbMATH DE number 3854804
From MaRDI portal
Publication:3323698
parametric linear programmingUpper bound problemstriangular factorizationtransshipment problemstheorem on doubly stochastic matricessystems of linear equationsspeeds of convergenceSimplex Methodsensitivity analysisprimal- dual methodperturbation techniquesbest approximate solutionmaximum flow programsKhachiyan algorithminventoryGeneralized upper boundingellipsoidal methoddualityDantzig-Wolfe decompositioncycling avoidancecutting stockconvex polyhedral set of feasible points
Stochastic matrices (15B51) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to calculus of variations and optimal control (49-01) Iterative numerical methods for linear systems (65F10) Numerical mathematical programming methods (65K05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Inventory, storage, reservoirs (90B05) Deterministic network models in operations research (90B10) Deterministic scheduling theory in operations research (90B35) Linear programming (90C05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) 2-person games (91A05)
Recommendations
Cited in
(only showing first 100 items - show all)- 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
- Computing monotone disjoint paths on polytopes
- Time-adaptive quantile regression
- Zonotopes with large 2D-cuts
- The convex hull of degree sequences of signed graphs
- An extension of Karmarkar's algorithm for linear programming using dual variables
- Strong linear independence in bottleneck algebra
- A Z-simplex algorithm with partial updates
- Enumerative techniques for solving some nonconvex global optimization problems
- Determining basic variables of optimal solutions in Karmarkar's new LP algorithm
- A linear-time algorithm for linear \(L_ 1\) approximation of points
- \(\ell^ 1\)-optimal control of multivariable systems with output norm constraints
- The translation square map and approximate congruence
- Quantitative Steinitz's theorems with applications to multifingered grasping
- The maximum number of second smallest distances in finite planar sets
- Maximum concurrent flows and minimum cuts
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
- A parametric successive underestimation method for convex multiplicative programming problems
- Reasoning about qualitative temporal information
- Discrete convex analysis
- Degeneracy graphs: Theory and applications. An updated survey
- Objects that cannot be taken apart with two hands
- Simplices by point-sliding and the Yamnitsky-Levin algorithm
- An objective general index for multivariate ordered data
- Heuristic and exact algorithms for the simultaneous assignment problem
- An \(L_{1}\) estimation algorithm with degeneracy and linear constraints.
- On point-duration networks for temporal reasoning
- Constraint programming and operations research
- \texttt{mplrs}: a scalable parallel vertex/facet enumeration code
- On ``pre-historic linear programming and the figure of the Earth
- A double oracle approach to minmax regret optimization problems with interval data
- Minimizing the number of independent sets in triangle-free regular graphs
- Boundary modeling in model-based calibration for automotive engines via the vertex representation of the convex hulls
- Stochastic separated continuous conic programming: strong duality and a solution method
- An algorithmic separating hyperplane theorem and its applications
- Computing solutions of the multiclass network equilibrium problem with affine cost functions
- Generalized probabilistic satisfiability
- The complexity of satisfiability in non-iterated and iterated probabilistic logics
- Finiteness of the quadratic primal simplex method when \(\mathbf s\)-monotone index selection rules are applied
- Solving interval linear systems with linear programming techniques
- A data structure for dynamic trees
- The many facets of linear programming
- Bounds for probabilistic integer programming problems
- Non-linear evolution using optimal fourth-order strong-stability-preserving Runge-Kutta methods
- The representation polyhedron of a semiorder.
- Reduced first-level representations via the reformulation-linearization technique: Results, counterexamples, and computations
- An algorithm to compute the nucleolus of shortest path games
- Comparative analysis of pattern-based models for the two-dimensional two-stage guillotine cutting stock problem
- Congestion control for a system with parallel stations and homogeneous customers using priority passes
- 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
- A solution framework for linear PDE-constrained mixed-integer problems
- The conditional \(p\)-dispersion problem
- 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
- An exact projection-based algorithm for bilevel mixed-integer problems with nonlinearities
- Sequence-based analysis of metabolic demands for protein synthesis in prokaryotes
- First-order automated reasoning with theories: when deduction modulo theory meets practice
- An exploratory computational analysis of dual degeneracy in mixed-integer programming
- A gradual facilitate high-order multivariate Markov chains model with application to the changes of exchange rates in Egypt: new approach
- On the extreme points of a family of matrices related to a theorem of Birkhoff
- Probabilization of logics: completeness and decidability
- Necessary and sufficient conditions of solution uniqueness in 1-norm minimization
- Optimal assignment schemes for general access structures based on linear programming
- Merging the local and global approaches to probabilistic satisfiability
- Kernel classification using a linear programming approach
- On the complexity of inconsistency measurement
- Template polyhedra and bilinear optimization
- A characterization theorem and an algorithm for a convex hull problem
- Backdoors to tractable answer set programming
- The story of perfectly orderable graphs
- Classification of companies using maximal margin ellipsoidal surfaces
- Fuzzy facility location-allocation problem under the Hurwicz criterion
- 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
- 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\)
- Alternative integer-linear-programming formulations of the Clar problem in hexagonal systems
- On the vertices of the k-additive core
- The design of optimum component test plans in the demonstration of a series system reliability
- Optimization of a long-short portfolio under nonconvex transaction cost
- Intrinsic formulation and Lagrange duality for elastic cable networks with geometrical nonlinearity
- Spectral simplex method
- Geometric and algebraic reduction for singular momentum maps
- On routing and scheduling a fleet of resource-constrained vessels to provide ongoing continuous patrol coverage
- A quantitative approach to belief revision in structured probabilistic argumentation
- A pivoting algorithm for linear programming with linear complementarity constraints
- Globally optimal clusterwise regression by column generation enhanced with heuristics, sequencing and ending subset optimization
- scientific article; zbMATH DE number 4130564 (Why is no real title available?)
- Linear programming
- scientific article; zbMATH DE number 2132174 (Why is no real title available?)
- A column-and-cut generation algorithm for planning of Canadian armed forces tactical logistics distribution
- A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem
- Graphs and algorithms in communication networks on seven league boots
- scientific article; zbMATH DE number 5641435 (Why is no real title available?)
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)
