scientific article; zbMATH DE number 3854804
zbMATH Open0537.90067MaRDI QIDQ3323698FDOQ3323698
Authors: Vašek Chvátal
Publication date: 1983
Title of this publication is not available (Why is that?)
Recommendations
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)
Cited In (only showing first 100 items - show all)
- Addendum to ``Recursively defined metric spaces without contraction
- Non-linear evolution using optimal fourth-order strong-stability-preserving Runge-Kutta methods
- The sparse signomial classification and regression model
- Rigorous solution of linear programming problems with uncertain data
- An algorithmic separating hyperplane theorem and its applications
- Spectral simplex method
- Computing multiple-output regression quantile regions
- Quantitative Steinitz's theorems with applications to multifingered grasping
- Strong linear independence in bottleneck algebra
- A pivoting algorithm for linear programming with linear complementarity constraints
- Solving interval linear systems with linear programming techniques
- A bijection between the \(d\)-dimensional simplices with distances in \(\{1,2\}\) and the partitions of \(d+1\)
- On robust online scheduling algorithms
- Optimization of a long-short portfolio under nonconvex transaction cost
- Objects that cannot be taken apart with two hands
- A branch-and-bound algorithm for solving a fixed charge problem in the profit optimization of sawn timber production
- The maximum number of second smallest distances in finite planar sets
- Determining basic variables of optimal solutions in Karmarkar's new LP algorithm
- Learning to compete, coordinate, and cooperate in repeated games using reinforcement learning
- Enumerating vertices of \(0/1\)-polyhedra associated with \(0/1\)-totally unimodular matrices
- Necessary and sufficient conditions of solution uniqueness in 1-norm minimization
- Generating all vertices of a polyhedron is hard
- A linear-time algorithm for linear \(L_ 1\) approximation of points
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
- 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
- Title not available (Why is that?)
- A convergent simplicial algorithm with \(\omega \)-subdivision and \(\omega \)-bisection strategies
- A modification of Karmarkar's linear programming algorithm
- Heuristic and exact algorithms for the simultaneous assignment problem
- A \texttt{cost-regular} based hybrid column generation approach
- Reasoning about qualitative temporal information
- Title not available (Why is that?)
- First-order automated reasoning with theories: when deduction modulo theory meets practice
- A data structure for dynamic trees
- Column-Generation in Integer Linear Programming
- The interior-point revolution in optimization: History, recent developments, and lasting consequences
- Title not available (Why is that?)
- Time-adaptive quantile regression
- An extension of Karmarkar's algorithm for linear programming using dual variables
- The translation square map and approximate congruence
- Equilibrium relations in a capital asset market: A mean absolute deviation approach
- Title not available (Why is that?)
- Zonotopes with large 2D-cuts
- On the complexity of inconsistency measurement
- Enumeration of Nash equilibria for two-player games
- Merging the local and global approaches to probabilistic satisfiability
- Unique sink orientations of grids
- 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
- Geometric and algebraic reduction for singular momentum maps
- Reduced first-level representations via the reformulation-linearization technique: Results, counterexamples, and computations
- 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
- Closed formulas in local sensitivity analysis for some classes of linear and non-linear problems
- Understanding and using linear programming
- Title not available (Why is that?)
- The representation polyhedron of a semiorder.
- A new ranking method to fuzzy data envelopment analysis
- A simplicial branch-and-bound algorithm conscious of special structures in concave minimization problems
- A least-squares minimum-cost network flow algorithm
- Exponentiality of the exchange algorithm for finding another room-partitioning
- The many facets of linear programming
- Bounds for probabilistic integer programming problems
- 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
- Title not available (Why is that?)
- An \(L_{1}\) estimation algorithm with degeneracy and linear constraints.
- \texttt{mplrs}: a scalable parallel vertex/facet enumeration code
- A characterization theorem and an algorithm for a convex hull problem
- An objective general index for multivariate ordered data
- 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
- 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
- A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method
- Computing Feasible Points of Bilevel Problems with a Penalty Alternating Direction Method
- Automatic synthesis of parallel algorithms
- Probabilistic temporal logic with countably additive semantics
- Robust vertex enumeration for convex hulls in high dimensions
- Title not available (Why is that?)
- A robust optimization method with successive linear programming for intensity-modulated radiation therapy
- Computing solutions of the multiclass network equilibrium problem with affine cost functions
- On point-duration networks for temporal reasoning
- An exploratory computational analysis of dual degeneracy in mixed-integer programming
- Constraint programming and operations research
- An algorithm to compute the nucleolus of shortest path games
- 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
- Classification of companies using maximal margin ellipsoidal surfaces
- Probabilization of logics: completeness and decidability
- A constrained least square approach to the estimation of the term structure of interest rates
- The multiple trip vehicle routing problem with backhauls in random fuzzy environment: using \((\alpha,\beta)\)-cost minimization model under the Hurwicz criterion
- A first look at picking dual variables for maximizing reduced cost fixing
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)