Solving continuous set covering problems by means of semi-infinite optimization. With an application in product portfolio optimization
From MaRDI portal
(Redirected from Publication:2168048)
Recommendations
- A continuous set covering problem as a quasidifferentiable optimization problem
- Reoptimization of set covering problems
- Set optimization problems of generalized semi-continuous set-valued maps with applications
- An approximation of feasible sets in semi-infinite optimization.
- Connectedness of the solution sets in generalized semi-infinite set optimization
- Solution of continuous problems of optimal covering with spheres using optimal set-partition theory
- Semi-infinite programming and applications to minimax problems
- Semi-infinite optimization: Structure and stability of the feasible set
- Optimum Problems with Certain Lower Semicontinuous Set-Valued Constraints
Cites work
- scientific article; zbMATH DE number 3595804 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- A continuous set covering problem as a quasidifferentiable optimization problem
- A feasible point adaptation of the Blankenship and Falk algorithm for semi-infinite programming
- A heuristic genetic algorithm for product portfolio planning
- A hybrid discretization algorithm with guaranteed feasibility for the global solution of semi-infinite programs
- A smoothing algorithm for finite min-max-min problems
- A transformation-based discretization method for solving general semi-infinite optimization problems
- Algorithms with adaptive smoothing for finite minimax problems
- An adaptive discretization method solving semi-infinite optimization problems with quadratic rate of convergence
- An efficient approach to a class of non-smooth optimization problems
- An efficient solution method to design the cost-minimizing platform portfolio
- Bi-level strategies in semi-infinite programming.
- Covering a polygonal region by rectangles
- Covering a rectangle with six and seven circles
- Discretization in semi-infinite programming: the rate of convergence
- Global optimization of generalized semi-infinite programs via restriction of the right hand side
- Infinitely constrained optimization problems
- John and Loewner ellipsoids
- Joint optimization of product family configuration and scaling design by Stackelberg game
- On the cross-entropic regularization method for solving min-max problems
- On the entropic regularization method for solving min-max problems with applications
- On the use of consistent approximations in the solution of semi-infinite optimization and optimal control problems
- Optimal product design using conjoint analysis: Computational complexity and algorithms
- Optimization of multiple covering of a bounded set with circles
- Optimization. Algorithms and consistent approximations
- Reducibility among combinatorial problems
- Semi-Infinite Programming: Theory, Methods, and Applications
- Semi-infinite programming
- Semi-infinite programming, duality, discretization and optimality conditions†
- Smoothing method for minimax problems
- Smoothing methods for nonsmooth, nonconvex minimization
- Solution of continuous problems of optimal covering with spheres using optimal set-partition theory
- Tools of mathematical modeling of arbitrary object packing problems
This page was built for publication: Solving continuous set covering problems by means of semi-infinite optimization. With an application in product portfolio optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2168048)
