scientific article; zbMATH DE number 3637614
From MaRDI portal
Publication:4197641
Cited in
(only showing first 100 items - show all)- A note on approximate Nash equilibria
- On the Chvátal rank of the pigeonhole principle
- A survey on the complexity of tournament solutions
- Exploiting special structure in semidefinite programming: a survey of theory and applications
- Scheduling subject to resource constraints: Classification and complexity
- Analysis of a linear programming heuristic for scheduling unrelated parallel machines
- An introduction to parallelism in combinatorial optimization
- Introduction: New approaches to linear programming
- Karmarkar's algorithm and its place in applied mathematics
- Objective functions and the complexity of policy design
- Solving systems of polynomial inequalities in subexponential time
- A new integer programming formulation for the permutation flowshop problem
- A branch and bound algorithm for the acyclic subgraph problem
- The ellipsoid method in linear programming
- On relaxation methods for systems of linear inequalities
- Complexity of linear programming
- Cost-effective allocations of bounded and binary resources in polynomial time
- On search over rationals
- The complexity of controlled selection
- The diagonalizability of quadratic functions and the arbitrariness of shadow prices
- Expressing combinatorial optimization problems by linear programs
- A geometric view of parametric linear programming
- Matching theory -- a sampler: From Dénes König to the present
- Projection algorithms for linear programming
- Minimum perfect bipartite matchings and spanning trees under categorization
- Method of centers for minimizing generalized eigenvalues
- Condition measures and properties of the central trajectory of a linear program
- Polynomial algorithms for linear programming over the algebraic numbers
- Geometric sets of low information content
- On linear programming and matrix scaling over the algebraic numbers
- On the properties of the subsets of a discrete domain defined by the local optimae of a function endowed with some geometrical properties
- Querying temporal and spatial constraint networks in PTIME
- Pivot versus interior point methods: Pros and cons
- The naive credal classifier
- Exact credal treatment of missing data
- The stable fixtures problem with payments
- A polynomial projection-type algorithm for linear programming
- Reformulation of the linear program for completely ergodic MDPs with average cost criteria
- Reasoning in fuzzy description logics using automata
- On the complexity of minmax regret linear programming
- A theorem of the alternative for multihomogeneous functions and its relationship to diagonal scaling of matrices
- Linear time algorithms for linear programming
- The trouble with the second quantifier
- Values for level structures with polynomial-time algorithms, relevant coalition functions, and general considerations
- The fractional multidimensional knapsack problem: solution and uniqueness
- A simple method for convex optimization in the oracle model
- A linear programming primer: from Fourier to Karmarkar
- Pricing lotteries
- Heuristics for scheduling unrelated parallel machines
- A polynomial algorithm for convex quadratic optimization subject to linear inequalities
- A space decomposition-based deterministic algorithm for solving linear optimization problems
- A hybrid gradient and feasible direction pivotal solution algorithm for general linear programs
- Bounds on the complexity of halfspace intersections when the bounded faces have small dimension
- Solutions for the stable roommates problem with payments
- On stable least squares solution to the system of linear inequalities
- A distributed computation algorithm for solving portfolio problems with integer variables
- A note on two fixed point problems
- A constraint generation algorithm for large scale linear programs using multiple-points separation
- Properties of MPC for max-plus-linear systems
- On the complexity of some geometric problems in unbounded dimension
- Regularizing conjunctive features for classification
- The differential of probabilistic entailment
- Deciding probabilistic automata weak bisimulation: theory and practice
- On the Turing model complexity of interior point methods for semidefinite programming
- scientific article; zbMATH DE number 5925034 (Why is no real title available?)
- scientific article; zbMATH DE number 3644821 (Why is no real title available?)
- An Analogue of the Shannon Capacity of a Graph
- New results on the average behavior of simplex algorithms
- Fractional dominating parameters
- Solving Simple Stochastic Games
- A hybrid approach of bundle and Benders applied large mixed linear integer problem
- scientific article; zbMATH DE number 3978821 (Why is no real title available?)
- Recent development in computational complexity characterization of Nash equilibrium
- Nash equilibria: complexity, symmetries, and approximation
- A guide to conic optimisation and its applications
- Selfish splittable flows and NP-completeness
- Prune-and-search with limited workspace
- scientific article; zbMATH DE number 4119927 (Why is no real title available?)
- A strongly polynomial-time algorithm for the strict homogeneous linear-inequality feasibility problem
- Efficient edge-skeleton computation for polytopes defined by oracles
- Exterior point simplex-type algorithms for linear and network optimization problems
- Ragnar Frisch and interior-point methods
- Method of alternating contractions and its applications to some convex optimization problems
- Finding and Recognizing Popular Coalition Structures
- On genuinely time bounded computations
- Algorithms to compute probabilistic bisimilarity distances for labelled Markov chains
- A new Lanczos-type algorithm for systems of linear equations
- On Stackelberg mixed strategies
- Simple Stochastic Games with Few Random Vertices Are Easy to Solve
- scientific article; zbMATH DE number 5049913 (Why is no real title available?)
- On the finding of final polynomials
- On solving the densest \(k\)-subgraph problem on large graphs
- Tensors in computations
- An ellipsoid algorithm for equality-constrained nonlinear programs
- On the parallel approximability of a subclass of quadratic programming.
- Convexity and global optimization: A theoretical link
- Exact computation of an error bound for the balanced linear complementarity problem with unique solution
- A gradient sampling algorithm for stratified maps with applications to topological data analysis
- Explainability of probabilistic bisimilarity distances for labelled Markov chains
- A geometric approach to betweenness
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)
