Search

Your search keyword '"APPROXIMATION algorithms"' showing total 212 results

Search Constraints

Start Over You searched for: Descriptor "APPROXIMATION algorithms" Remove constraint Descriptor: "APPROXIMATION algorithms" Topic mathematical optimization Remove constraint Topic: mathematical optimization Publisher springer nature Remove constraint Publisher: springer nature
212 results on '"APPROXIMATION algorithms"'

Search Results

1. Approximations for generalized unsplittable flow on paths with application to power systems optimization.

2. A Norm Minimization-Based Convex Vector Optimization Algorithm.

3. Quantum computational phase transition in combinatorial problems.

4. Limited-memory BFGS with displacement aggregation.

5. An approximation algorithm for multi-objective optimization problems using a box-coverage.

6. Self-guided quantum state tomography for limited resources.

7. Empirical performance bounds for quantum approximate optimization.

8. Classical symmetries and the Quantum Approximate Optimization Algorithm.

9. The matching augmentation problem: a 74-approximation algorithm.

10. Bi-criteria path problem with minimum length and maximum survival probability.

11. The Minimum Feasible Tileset Problem.

12. Approximation algorithms for k-echelon extensions of the one warehouse multi-retailer problem.

13. New algorithms for maximum disjoint paths based on tree-likeness.

14. Model based optimization of a statistical simulation model for single diamond grinding.

15. Costly circuits, submodular schedules and approximate Carathéodory Theorems.

16. A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information.

17. Human Strategy (HS) Optimization Algorithm.

18. Approximating (Unweighted) Tree Augmentation via Lift-and-Project, Part II.

19. Simpler and Better Approximation Algorithms for the Unweighted Minimum Label s- t Cut Problem.

20. Robust Proximity Search for Balls Using Sublinear Space.

21. An FPT 2-Approximation for Tree-Cut Decomposition.

22. Approximation algorithms for optimization of real-valued general conjugate complex forms.

23. Multiobjective variable mesh optimization.

24. Attracting and quasi-invariant sets of neutral stochastic integro-differential equations with impulses driven by fractional Brownian motion.

25. Integrated Optimization Strategies for Dynamic Process Operations.

26. Mathematical Programming Techniques for Optimization under Uncertainty and Their Application in Process Systems Engineering.

27. Trading Off Worst and Expected Cost in Decision Tree Problems.

28. Decision Trees for Function Evaluation: Simultaneous Optimization of Worst and Expected Cost.

29. Set It and Forget It: Approximating the Set Once Strip Cover Problem.

30. Simulated annealing based GRASP for Pareto-optimal dissimilar paths problem.

32. Approximation guarantees of algorithms for fractional optimization problems arising in dispatching rules for INDS problems.

33. Limits of Local Search: Quality and Efficiency.

34. Improved Approximation Algorithms for Box Contact Representations.

37. A 2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves.

38. MONEDA: scalable multi-objective optimization with a neural network-based estimation of distribution algorithm.

39. Top- k overlapping densest subgraphs.

40. On certain approaches to optimization of control processes. I.

41. Competing risks data analysis under the accelerated failure time model with missing cause of failure.

42. Analysing differences between algorithm configurations through ablation.

43. Dynamic programming approximation algorithms for the capacitated lot-sizing problem.

44. Application of the small parameter method to the singularly perturbed linear-quadratic optimal control problem.

45. Convex Optimization on Banach Spaces.

46. Geometric partitioning and robust ad-hoc network design.

47. Approximation of a quantum algorithm for order finding.

48. Combinatorial approximation algorithms for the robust facility location problem with penalties.

49. Numerical methods for solving terminal optimal control problems.

50. Improved Approximation for Orienting Mixed Graphs.

Catalog

Books, media, physical & digital resources