Entity usage

From MaRDI portal

This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.

List of pages that use a given entity

Showing below up to 50 results in range #51 to #100.

View ( | ) (20 | 50 | 100 | 250 | 500)

  1. Structure-driven fix-and-propagate heuristics for mixed integer programming: Label: en
  2. A derivative-free Gauss-Newton method: Label: en
  3. Optimizing over pure stationary equilibria in consensus stopping games: Label: en
  4. Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra: Label: en
  5. Solving linear programs with complementarity constraints using branch-and-cut: Label: en
  6. QPLIB: a library of quadratic programming instances: Label: en
  7. The (not so) trivial lifting in two dimensions: Label: en
  8. Information-based branching schemes for binary linear mixed integer problems: Label: en
  9. A structure-conveying modelling language for mathematical and stochastic programming: Label: en
  10. A column and constraint generation algorithm for the dynamic knapsack problem with stochastic item sizes: Label: en
  11. MiniCP: a lightweight solver for constraint programming: Label: en
  12. Mixed-integer programming techniques for the connected max-\(k\)-cut problem: Label: en
  13. Hard to solve instances of the Euclidean traveling salesman problem: Label: en
  14. Asynchronous Lagrangian scenario decomposition: Label: en
  15. An algorithmic framework based on primitive directions and nonmonotone line searches for black-box optimization problems with integer variables: Label: en
  16. OSQP: An Operator Splitting Solver for Quadratic Programs: Label: en
  17. Implementation of an interior point method with basis preconditioning: Label: en
  18. A multi-stage convex relaxation approach to noisy structured low-rank matrix recovery: Label: en
  19. A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation: Label: en
  20. Parsimonious formulations for low-diameter clusters: Label: en
  21. An adaptive primal-dual framework for nonsmooth convex minimization: Label: en
  22. A rotation-based branch-and-price approach for the nurse scheduling problem: Label: en
  23. Generation techniques for linear programming instances with controllable properties: Label: en
  24. Robust Euclidean embedding via EDM optimization: Label: en
  25. Split cuts from sparse disjunctions: Label: en
  26. Outer approximation with conic certificates for mixed-integer convex problems: Label: en
  27. \(K\)-adaptability in two-stage mixed-integer robust optimization: Label: en
  28. On the impact of running intersection inequalities for globally solving polynomial optimization problems: Label: en
  29. On integer and bilevel formulations for the \(k\)-vertex cut problem: Label: en
  30. Special issue forward: The 2018 mixed integer programming workshop: Label: en
  31. Exploiting sparsity for the min \(k\)-partition problem: Label: en
  32. Partial hyperplane activation for generalized intersection cuts: Label: en
  33. A branch-and-price algorithm for capacitated hypergraph vertex separation: Label: en
  34. A hybrid quasi-Newton projected-gradient method with application to lasso and basis-pursuit denoising: Label: en
  35. Efficient unconstrained black box optimization: Label: en
  36. Adaptive primal-dual stochastic gradient method for expectation-constrained convex stochastic programs: Label: en
  37. LMBOPT: a limited memory method for bound-constrained optimization: Label: en
  38. An augmented Lagrangian method with constraint generation for shape-constrained convex regression problems: Label: en
  39. Adaptive large neighborhood search for mixed integer programming: Label: en
  40. \texttt{acados} -- a modular open-source framework for fast embedded optimal control: Label: en
  41. On scaled stopping criteria for a safeguarded augmented Lagrangian method with theoretical guarantees: Label: en
  42. Dantzig-Wolfe reformulations for binary quadratic problems: Label: en
  43. Optimal patchings for consecutive ones matrices: Label: en
  44. Scalable branching on dual decomposition of stochastic mixed-integer programming problems: Label: en
  45. An integrated local-search/set-partitioning refinement heuristic for the capacitated vehicle routing problem: Label: en
  46. A graph-based modeling abstraction for optimization: concepts and implementation in Plasmo.jl: Label: en
  47. Enhanced formulation for the Guillotine 2D Cutting knapsack problem: Label: en
  48. Political districting to minimize cut edges: Label: en
  49. Limited-memory common-directions method for large-scale optimization: convergence, parallelization, and distributed optimization: Label: en
  50. QPALM: a proximal augmented Lagrangian method for nonconvex quadratic programs: Label: en

View ( | ) (20 | 50 | 100 | 250 | 500)

Retrieved from "https://portal.mardi4nfdi.de/wiki/Special:EntityUsage/Q266404"
Powered by MediaWiki