Pages that link to "Item:Q1567074"
From MaRDI portal
The following pages link to Heuristic methods for linear multiplicative programming (Q1567074):
Displaying 33 items.
- Theoretical and computational results about optimality-based domain reductions (Q288410) (← links)
- Quadratic factorization heuristics for copositive programming (Q542052) (← links)
- A new linearization method for generalized linear multiplicative programming (Q622153) (← links)
- A FPTAS for a class of linear multiplicative problems (Q849090) (← links)
- An outcome-space finite algorithm for solving linear multiplicative programming (Q849749) (← links)
- Linearization method for a class of multiplicative programming with exponent (Q864775) (← links)
- An efficient algorithm for globally solving generalized linear multiplicative programming (Q899000) (← links)
- A convex analysis approach for convex multiplicative programming (Q934807) (← links)
- A nonisolated optimal solution of general linear multiplicative programming problems (Q1010262) (← links)
- Linear multiplicative programming (Q1207311) (← links)
- Multiplicative programming problems: Analysis and efficient point search heuristic (Q1367730) (← links)
- On duality for a class of quasiconcave multiplicative programs (Q1411526) (← links)
- Range division and linearization algorithm for a class of linear ratios optimization problems (Q1713180) (← links)
- A global optimization approach for solving generalized nonlinear multiplicative programming problem (Q1724645) (← links)
- An out space accelerating algorithm for generalized affine multiplicative programs problem (Q1794179) (← links)
- Outer space branch-reduction-bound algorithm for solving generalized affine multiplicative problems (Q2088876) (← links)
- Global optimization method for linear multiplicative programming (Q2355349) (← links)
- Solving a class of generalized fractional programming problems using the feasibility of linear programs (Q2360402) (← links)
- A simplicial branch and bound duality-bounds algorithm to linear multiplicative programming (Q2375741) (← links)
- A method of acceleration for a class of multiplicative programming problems with exponent (Q2378273) (← links)
- Global optimization algorithm for a generalized linear multiplicative programming (Q2511121) (← links)
- A branch and bound algorithm for globally solving a class of nonconvex programming problems (Q2518145) (← links)
- Global algorithm for a class of multiplicative programs using piecewise linear approximation technique (Q2679815) (← links)
- An Outcome Space Branch-and-Bound Algorithm for a Class of Linear Multiplicative Programming Problems (Q2942454) (← links)
- Nonlinear 0–1 programming: I. Linearization techniques (Q3216430) (← links)
- (Q3747717) (← links)
- Duality for linear multiplicative programs (Q4673140) (← links)
- An efficient algorithm for computing a class of multiplicative optimization problem (Q5069808) (← links)
- Global optimization algorithm for solving linear multiplicative programming problems (Q5085229) (← links)
- An efficient spatial branch-and-bound algorithm using an adaptive branching rule for linear multiplicative programming (Q6099489) (← links)
- A criterion-space branch-reduction-bound algorithm for solving generalized multiplicative problems (Q6568950) (← links)
- Output-space outer approximation branch-and-bound algorithm for a class of linear multiplicative programs (Q6614694) (← links)
- A method based on parametric convex programming for solving convex multiplicative programming problem (Q6631563) (← links)
