Kategorie: DDC-Klasse 519.6
607 Titel
-
Global convergence of a proximal linearized algorithm for difference of convex functions
-
Improved branch-cut-and-price for capacitated vehicle routing
-
Strategic oscillation for the capacitated hub location problem with modular links
-
Social Networks and the Economics of Sports
-
A Lagrangian heuristic for concave cost facility location problems: the plant location and technology acquisition problem
-
On Laplacian spectra of parametric families of closely connected networks with application to cooperative control
-
Two-Phase-SQP Method with Higher-Order Convergence Property
-
Column generation approaches for the software clustering problem
-
A unified solving approach for two and three dimensional coverage problems in sensor networks
-
Balancing efficiency and equity in location-allocation models with an application to strategic EMS design
-
A polynomially solvable case of the pooling problem
-
Scatter search for the bandpass problem
-
Feature subset selection for logistic regression via mixed integer optimization
-
On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions
-
Certificates of infeasibility via nonsmooth optimization
-
A new local dimming algorithm based on the simplex method
-
Exact solution approaches for bilevel assignment problems
-
A parallel maximum clique algorithm for large and massive sparse graphs
-
Two-stage, single-lot, lot streaming problem for a $$1+2$$ 1 + 2 hybrid flow shop
-
An extragradient method for equilibrium problems on Hadamard manifolds