No label defined (Q5743409)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7053288

Language	Label	Description	Also known as
English	No label defined	scientific article; zbMATH DE number 7053288

Statements

scholarly article

0 references

Konstantin Makarychev

0 references

0 references

M. I. Sviridenko

0 references

publication date

10 May 2019

0 references

full work available at URL

https://dl.acm.org/citation.cfm?id=2095152

0 references

MaRDI profile type

MaRDI publication profile

0 references

Pipage rounding: a new method of constructing algorithms with proven performance guarantee

0 references

A new rounding procedure for the assignment problem with applications to dense graph arrangement problems

0 references

0 references

Convex programming for scheduling unrelated parallel machines

0 references

Parametric nonlinear discrete optimization over well-described sets and matroid intersections

0 references

Nonlinear Matroid Optimization and Experimental Design

0 references

Nonlinear bipartite matching

0 references

Advanced Lectures on Machine Learning

0 references

0 references

Concentration Inequalities and Martingale Inequalities: A Survey

0 references

Solving the quadratic minimum spanning tree problem

0 references

Concentration of Measure for the Analysis of Randomized Algorithms

0 references

Fuzzy quadratic minimum spanning tree problem

0 references

Concentration of multivariate polynomials and its applications

0 references

Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints

0 references

Submodular Maximization over Multiple Matroids via Generalized Exchange Properties

0 references

Approximate Nonlinear Optimization over Weighted Independence Systems

0 references

0 references

0 references

Minimum spanning trees made easier via multi-objective optimization

0 references

0 references

The quadratic minimum spanning tree problem: a lower bounding procedure and an efficient search algorithm

0 references

0 references

Randomized rounding: A technique for provably good algorithms and algorithmic proofs

0 references

0 references

Combinatorial optimization. Polyhedra and efficiency (3 volumes)

0 references

An approximation algorithm for the generalized assignment problem

0 references

Survey Paper—Time Window Constrained Routing and Scheduling Problems

0 references

Convex quadratic and semidefinite programming relaxations in scheduling

0 references

A Multiobjective Branch-and-Bound Framework: Application to the Biobjective Spanning Tree Problem

0 references

A unified approach to scheduling on unrelated parallel machines

0 references

Concentration of non‐Lipschitz functions and applications

0 references

On the concentration of multivariate polynomials with small expectation

0 references

An effective genetic algorithm approach to the quadratic minimum spanning tree problem

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5743409

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5743409&oldid=36492065"