scientific article; zbMATH DE number 3637614

zbMATH Open0409.90079MaRDI QIDQ4197641FDOQ4197641

Publication date: 1979

Title of this publication is not available (Why is that?)

Computational Complexity Vector Optimization Simplex Method Complex Linear Programming Problem Consistency of Systems of Linear Inequalities Polynomial Solvability Set Solutions

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Analysis of algorithms and problem complexity (68Q25) Sensitivity, stability, parametric optimization (90C31)

Cited In (only showing first 100 items - show all)

On the finding of final polynomials
Projection algorithms for linear programming
Title not available (Why is that?)
Heuristics for scheduling unrelated parallel machines
Exact credal treatment of missing data
The naive credal classifier
Properties of MPC for max-plus-linear systems
Reasoning in fuzzy description logics using automata
A hybrid gradient and feasible direction pivotal solution algorithm for general linear programs
Tensors in computations
Nash equilibria: complexity, symmetries, and approximation
Polynomial algorithms for linear programming over the algebraic numbers
Deciding probabilistic automata weak bisimulation: theory and practice
Expressive markets for donating to charities
Exploiting special structure in semidefinite programming: a survey of theory and applications
Method of centers for minimizing generalized eigenvalues
Experiments with external pivoting
Title not available (Why is that?)
A survey on the complexity of tournament solutions
Expressing combinatorial optimization problems by linear programs
A theorem of the alternative for multihomogeneous functions and its relationship to diagonal scaling of matrices
On the complexity of some geometric problems in unbounded dimension
New complexity results about Nash equilibria
A \(\mathcal O(1/k^{3/2})\) hybrid proximal extragradient primal-dual interior point method for nonlinear monotone mixed complementarity problems
New results on the average behavior of simplex algorithms
Updating beliefs with incomplete observations
An interior-point method for nonlinear optimization problems with locatable and separable nonsmoothness
On the hardness of computing intersection, union and Minkowski sum of polytopes
Scheduling subject to resource constraints: Classification and complexity
Selfish splittable flows and NP-completeness
Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses
Domination, independent domination, and duality in strongly chordal graphs
Title not available (Why is that?)
Solving Simple Stochastic Games
A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
Solutions for the stable roommates problem with payments
A polynomial algorithm for minimum quadratic cost flow problems
Pricing lotteries
Matching theory -- a sampler: From Dénes König to the present
Linear time algorithms for linear programming
Title not available (Why is that?)
A note on approximate Nash equilibria
Condition measures and properties of the central trajectory of a linear program
Recent development in computational complexity characterization of Nash equilibrium
Exterior point simplex-type algorithms for linear and network optimization problems
Analysis of a linear programming heuristic for scheduling unrelated parallel machines
On genuinely time bounded computations
Total weak unimodularity: Testing and applications
A distributed computation algorithm for solving portfolio problems with integer variables
Computing the minimal covering set
A polynomial algorithm for convex quadratic optimization subject to linear inequalities
Prune-and-search with limited workspace
An introduction to parallelism in combinatorial optimization
A geometric view of parametric linear programming
A strongly polynomial-time algorithm for the strict homogeneous linear-inequality feasibility problem
Solving systems of polynomial inequalities in subexponential time
On search over rationals
Performance evaluation of concurrent systems using Petri nets
Efficient edge-skeleton computation for polytopes defined by oracles
A hybrid approach of bundle and Benders applied large mixed linear integer problem
On the complexity of minmax regret linear programming
Simple Stochastic Games with Few Random Vertices Are Easy to Solve
Approximating linear programming is log-space complete for P
Ranking games
Ragnar Frisch and interior-point methods
Minimum perfect bipartite matchings and spanning trees under categorization
On stable least squares solution to the system of linear inequalities
Geometric sets of low information content
Complexity of linear programming
On Stackelberg mixed strategies
A branch and bound algorithm for the acyclic subgraph problem
Semidefinite programming and arithmetic circuit evaluation
Introduction: New approaches to linear programming
Pivot versus interior point methods: Pros and cons
Karmarkar's algorithm and its place in applied mathematics
Finding and Recognizing Popular Coalition Structures
Objective functions and the complexity of policy design
A geometric approach to betweenness
An interior proximal gradient method for nonconvex optimization
Exact computation of an error bound for the balanced linear complementarity problem with unique solution
A guide to conic optimisation and its applications
On semidefinite programming characterizations of the numerical radius and its dual norm
An Analogue of the Shannon Capacity of a Graph
A new integer programming formulation for the permutation flowshop problem
Explainability of probabilistic bisimilarity distances for labelled Markov chains
A gradient sampling algorithm for stratified maps with applications to topological data analysis
Fractional dominating parameters
A simple method for convex optimization in the oracle model
The stable fixtures problem with payments
The ellipsoid method in linear programming
On relaxation methods for systems of linear inequalities
The trouble with the second quantifier
Algorithms to compute probabilistic bisimilarity distances for labelled Markov chains
The fractional multidimensional knapsack problem: solution and uniqueness
The differential of probabilistic entailment
Cost-effective allocations of bounded and binary resources in polynomial time
A polynomial projection-type algorithm for linear programming
A new Lanczos-type algorithm for systems of linear equations
On the Turing model complexity of interior point methods for semidefinite programming
A simple method for convex optimization in the oracle model

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 Q4197641)