scientific article; zbMATH DE number 3637614
From MaRDI portal
Publication:4197641
Cited in
(only showing first 100 items - show all)- On the finding of final polynomials
- Projection algorithms for linear programming
- A new long-step interior point algorithm for linear programming based on the algebraic equivalent transformation
- The possible winner with uncertain weights problem
- Karmarkar's algorithm and its place in applied mathematics
- scientific article; zbMATH DE number 3644821 (Why is no real title available?)
- Objective functions and the complexity of policy design
- Finding and Recognizing Popular Coalition Structures
- A geometric approach to betweenness
- Exact credal treatment of missing data
- The naive credal classifier
- Heuristics for scheduling unrelated parallel machines
- Properties of MPC for max-plus-linear systems
- Reasoning in fuzzy description logics using automata
- Nash equilibria: complexity, symmetries, and approximation
- A hybrid gradient and feasible direction pivotal solution algorithm for general linear programs
- Polynomial algorithms for linear programming over the algebraic numbers
- Deciding probabilistic automata weak bisimulation: theory and practice
- Tensors in computations
- Expressive markets for donating to charities
- An interior proximal gradient method for nonconvex optimization
- Exploiting special structure in semidefinite programming: a survey of theory and applications
- Experiments with external pivoting
- Method of centers for minimizing generalized eigenvalues
- Exact computation of an error bound for the balanced linear complementarity problem with unique solution
- A survey on the complexity of tournament solutions
- A guide to conic optimisation and its applications
- Expressing combinatorial optimization problems by linear programs
- scientific article; zbMATH DE number 5049913 (Why is no real title available?)
- A theorem of the alternative for multihomogeneous functions and its relationship to diagonal scaling of matrices
- A new integer programming formulation for the permutation flowshop problem
- On semidefinite programming characterizations of the numerical radius and its dual norm
- An Analogue of the Shannon Capacity of a Graph
- On the complexity of some geometric problems in unbounded dimension
- New complexity results about Nash equilibria
- Explainability of probabilistic bisimilarity distances for labelled Markov chains
- A \(\mathcal O(1/k^{3/2})\) hybrid proximal extragradient primal-dual interior point method for nonlinear monotone mixed complementarity problems
- Updating beliefs with incomplete observations
- New results on the average behavior of simplex algorithms
- A gradient sampling algorithm for stratified maps with applications to topological data analysis
- 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
- Fractional dominating parameters
- A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
- scientific article; zbMATH DE number 4119927 (Why is no real title available?)
- Solving Simple Stochastic Games
- A polynomial algorithm for minimum quadratic cost flow problems
- Matching theory -- a sampler: From Dénes König to the present
- Solutions for the stable roommates problem with payments
- Pricing lotteries
- Linear time algorithms for linear programming
- The stable fixtures problem with payments
- scientific article; zbMATH DE number 5925034 (Why is no real title available?)
- A note on approximate Nash equilibria
- Recent development in computational complexity characterization of Nash equilibrium
- Exterior point simplex-type algorithms for linear and network optimization problems
- Condition measures and properties of the central trajectory of a linear program
- A simple method for convex optimization in the oracle model
- Analysis of a linear programming heuristic for scheduling unrelated parallel machines
- The ellipsoid method in linear programming
- On relaxation methods for systems of linear inequalities
- The trouble with the second quantifier
- On genuinely time bounded computations
- The fractional multidimensional knapsack problem: solution and uniqueness
- Total weak unimodularity: Testing and applications
- The differential of probabilistic entailment
- Cost-effective allocations of bounded and binary resources in polynomial time
- Algorithms to compute probabilistic bisimilarity distances for labelled Markov chains
- A polynomial projection-type algorithm for linear programming
- Computing the minimal covering set
- A distributed computation algorithm for solving portfolio problems with integer variables
- A polynomial algorithm for convex quadratic optimization subject to linear inequalities
- On the Turing model complexity of interior point methods for semidefinite programming
- Prune-and-search with limited workspace
- A new Lanczos-type algorithm for systems of linear equations
- A simple method for convex optimization in the oracle model
- The complexity of controlled selection
- An introduction to parallelism in combinatorial optimization
- On the Chvátal rank of the pigeonhole principle
- Reformulation of the linear program for completely ergodic MDPs with average cost criteria
- 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
- The diagonalizability of quadratic functions and the arbitrariness of shadow prices
- On search over rationals
- A linear programming primer: from Fourier to Karmarkar
- Performance evaluation of concurrent systems using Petri nets
- Efficient edge-skeleton computation for polytopes defined by oracles
- Values for level structures with polynomial-time algorithms, relevant coalition functions, and general considerations
- A hybrid approach of bundle and Benders applied large mixed linear integer problem
- On the complexity of minmax regret linear programming
- Approximating linear programming is log-space complete for P
- Ranking games
- On solving the densest \(k\)-subgraph problem on large graphs
- Ragnar Frisch and interior-point methods
- A constraint generation algorithm for large scale linear programs using multiple-points separation
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)
