Pages that link to "Item:Q1099780"

The following pages link to Constrained global optimization: algorithms and applications (Q1099780):

Displaying 50 items.

• On the solution of concave knapsack problems (Q2276878) (← links)
• An explicit characterization of the convex envelope of a bivariate bilinear function over special polytopes (Q2276885) (← links)
• Minimum concave-cost network flow problems: Applications, complexity, and algorithms (Q2277131) (← links)
• Separable concave minimization via partial outer approximation and branch and bound (Q2277369) (← links)
• A logarithmic descent direction algorithm for the quadratic knapsack problem (Q2287590) (← links)
• Closed-form formulas for evaluating \(r\)-flip moves to the unconstrained binary quadratic programming problem (Q2333129) (← links)
• Feature extraction algorithms for constrained global optimization. I: Mathematical foundation (Q2368102) (← links)
• Feature extraction algorithms for constrained global optimization. II: Batch process scheduling application (Q2368103) (← links)
• A filled function method for global optimization (Q2372909) (← links)
• A simplicial branch and bound duality-bounds algorithm to linear multiplicative programming (Q2375741) (← links)
• Promoting symmetric weight selection in data envelopment analysis: a penalty function approach (Q2379559) (← links)
• A deterministic global optimization algorithm based on a linearizing method for nonconvex quadratically constrained programs (Q2389836) (← links)
• Solving nonlinearly constrained global optimization problem via an auxiliary function method (Q2389996) (← links)
• Sufficient global optimality conditions for non-convex quadratic minimization problems with box constraints (Q2433932) (← links)
• Parallelizing simulated annealing algorithms based on high-performance computer (Q2454729) (← links)
• Exceptional families of elements for set-valued mappings: an application to nonlinear complementarity problems (Q2472819) (← links)
• Globally tight bounds for almost differentiable functions over polytopes with application to tolerance analysis. (Q2477109) (← links)
• New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds (Q2492668) (← links)
• Sharp bounds for the maximum of the chi-square index in a class of contingency tables with given marginals (Q2563669) (← links)
• Lagrangian duality of concave minimization subject to linear constraints and an additional facial reverse convex constraint (Q2564166) (← links)
• Generalized primal-relaxed dual approach for global optimization (Q2565021) (← links)
• A new rectangle branch-and-reduce approach for solving nonconvex quadratic programming problems (Q2572774) (← links)
• Effective relaxation for microstructure simulations: algorithms and applications (Q2573199) (← links)
• Graph separation techniques for quadratic zero-one programming (Q2638933) (← links)
• On solving general reverse convex programming problems by a sequence of linear programs and line searches (Q2638938) (← links)
• A decomposition approach for global optimum search in QP, NLP and MINLP problems (Q2638940) (← links)
• Global optimization of a quadratic function subject to a bounded mixed integer constraint set (Q2640438) (← links)
• An implicit enumeration method for global optimization problems (Q2641085) (← links)
• Improving an optimization-based framework for sensitivity analysis in multi-criteria decision-making (Q2720013) (← links)
• On Approximation Algorithms for Concave Mixed-Integer Quadratic Programming (Q3186487) (← links)
• An algorithm for concave integer minimization over a polyhedron (Q3200886) (← links)
• Automatic loop shaping in QFT using hybrid optimization and constraint propagation techniques (Q3418076) (← links)
• Guaranteed \(\epsilon\)-approximate solution for indefinite quadratic global minimization (Q3491318) (← links)
• Deterministic methods in constrained global optimization: Some recent advances and new fields of application (Q3494393) (← links)
• A global optimization approach for solving the maximum clique problem (Q4009762) (← links)
• Dynamic slope scaling and trust interval techniques for solving concave piecewise linear network flow problems (Q4488862) (← links)
• Stochastic allocation of inspection capacity to competitive processes (Q4539886) (← links)
• (Q4547468) (← links)
• A Two-Phase Gradient Method for Quadratic Programming Problems with a Single Linear Constraint and Bounds on the Variables (Q4687242) (← links)
• A face search heuristic algorithm for optimizing over the efficient set (Q4695784) (← links)
• Facility location and capacity acquisition: An integrated approach (Q4859573) (← links)
• Spectral Properties of Barzilai--Borwein Rules in Solving Singly Linearly Constrained Optimization Problems Subject to Lower and Upper Bounds (Q5110558) (← links)
• A sufficient conditions for global quadratic optimization (Q5147640) (← links)
• Subdeterminants and Concave Integer Quadratic Programming (Q5206942) (← links)
• A branch and bound algorithm for the maximum clique problem (Q5905591) (← links)
• Solvability of implicit complementarity problems (Q5920451) (← links)
• Duality bound method for the general quadratic programming problem with quadratic constraints (Q5925726) (← links)
• Constraint aggregation for rigorous global optimization (Q5962722) (← links)
• Conditional gradient and bisection algorithms for non-convex optimization problem with random perturbation (Q6106813) (← links)
• A general purpose exact solution method for mixed integer concave minimization problems (Q6112823) (← links)