scientific article; zbMATH DE number 757675
From MaRDI portal
Publication:4833804
Recommendations
Cited in
(42)- Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem
- Methods for Global Concave Minimization: A Bibliographic Survey
- A dynamic inventory model with supplier selection in a serial supply chain structure
- Sign reversion approach to concave minimization problems
- Fractional programming with convex quadratic forms and functions
- scientific article; zbMATH DE number 1560354 (Why is no real title available?)
- Canonical duality theory: connections between nonconvex mechanics and global optimization
- A differential evolution algorithm to deal with box, linear and quadratic-convex constraints for boundary optimization
- On the complexity of detecting convexity over a box
- Global optimization from concave minimization to concave mixed variational inequality
- Convergence analysis of a norm minimization-based convex vector optimization algorithm
- Computational complexity and algorithms for two scheduling problems under linear constraints
- An algebra-based approach for linearly constrained concave minimization
- PaMILO: a solver for multi-objective mixed integer linear optimization and beyond
- A continuous knapsack problem with separable convex utilities: approximation algorithms and applications
- Contractors' minimum spanning tree
- Subdivision of simplices relative to a cutting plane and finite concave minimization
- Generalized \(\gamma\)-valid cut procedure for concave minimization
- Solving sum of ratios fractional programs via concave minimization
- A norm minimization-based convex vector optimization algorithm
- On measuring the inefficiency with the inner-product norm in data envelopment analysis
- The profit maximization problem in economies of scale
- A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
- Lagrangian duality of concave minimization subject to linear constraints and an additional facial reverse convex constraint
- Piece adding technique for convex maximization problems
- scientific article; zbMATH DE number 878245 (Why is no real title available?)
- Solving polyhedral d.c. optimization problems via concave minimization
- On convergence of the simplicial branch-and-bound algorithm based on \(\omega\)-subdivisions
- Multiplicative programming problems: Analysis and efficient point search heuristic
- Enumerative techniques for solving some nonconvex global optimization problems
- scientific article; zbMATH DE number 37080 (Why is no real title available?)
- scientific article; zbMATH DE number 2208631 (Why is no real title available?)
- ALGORITHMS FOR L-CONVEX FUNCTION MINIMIZATION: CONNECTION BETWEEN DISCRETE CONVEX ANALYSIS AND OTHER RESEARCH FIELDS
- Robust storage loading problems with stacking and payload constraints
- Decomposition approach for the global minimization of biconcave functions over polytopes
- Maximization of generalized convex functionals in locally convex spaces.
- On the global minimization of concave functions
- Concave Minimization Via Collapsing Polytopes
- Global minimization algorithms for concave quadratic programming problems
- Convex Maximization via Adjustable Robust Optimization
- Inscribed ball and enclosing box methods for the convex maximization problem
- Solving set-valued optimization problems using a multiobjective approach
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4833804)
