Set covering-based surrogate approach for solving sup-T equation constrained optimization problems
From MaRDI portal
Publication:540668
Recommendations
- Optimization algorithms based on solving an equation which contains a reachability function
- A surrogate heuristic for set covering problems
- An interior point algorithm to solve computationally difficult set covering problems
- scientific article; zbMATH DE number 3934777
- scientific article; zbMATH DE number 3913634
Cites work
- scientific article; zbMATH DE number 45267 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 193499 (Why is no real title available?)
- scientific article; zbMATH DE number 3470465 (Why is no real title available?)
- scientific article; zbMATH DE number 4121754 (Why is no real title available?)
- scientific article; zbMATH DE number 2225808 (Why is no real title available?)
- A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering
- A genetic algorithm for the set covering problem
- A modified algorithm for solving the proposed models by Ghodousian and Khorram and Khorram and Ghodousian
- A multi‐objective mathematical programming problem with fuzzy relation constraints
- A note on a paper by E. Khorram and A. Ghodousian
- A note on a paper by Molai and Khorram
- A note on fuzzy relation programming problems with max-strict-\(t\)-norm composition
- A note on systems with max-min and max-product constraints
- A surrogate heuristic for set covering problems
- A survey on fuzzy relational equations. I: Classification and solvability
- Algorithms for the set covering problem
- An algorithm for optimizing the linear function with fuzzy relation equation constraints regarding max-prod composition
- An algorithm for set covering problem
- An algorithm for solving fuzzy relation equations with \(\max\)-\(T\) composition operator
- An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation
- Graph theory, combinatorics and algorithms. Interdisciplinary applications
- Latticized linear programming and fuzzy relation inequalities
- Linear objective function optimization with fuzzy relation equation constraints regarding max--av composition
- Minimizing a linear function under a fuzzy max-min relational equation constraint
- Minimizing a linear objective function with fuzzy relation equation constraints
- Multi-objective optimization problems with fuzzy relation equation constraints
- On generalized fuzzy relational equations and their applications
- On the relation between equations with max-product composition and the covering problem
- On the resolution and optimization of a system of fuzzy relational equations with sup-\(T\) composition
- Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
- Optimization of fuzzy relation equations with max-product composition.
- Posynomial Fuzzy Relation Geometric Programming
- Resolution of composite fuzzy relation equations
- Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
- Solving fuzzy relation equations with a linear objective function
- Validation of subgradient optimization
Cited in
(5)- A set covering based approach to find the reduct of variable precision rough set
- Randomly generating test problems for fuzzy relational equations
- Solving nonlinear optimization problems with bipolar fuzzy relational equation constraints
- Surrogate constraint normalization for the set covering problem
- Infinite fuzzy relational equations with sup-conjunctor on complete Brouwerian lattices
This page was built for publication: Set covering-based surrogate approach for solving sup-\({\mathcal{T}}\) equation constrained optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q540668)
