Export Citations
No abstract available.
Cited By
- Pham Q, Lau H, Hà M and Vu L An efficient hybrid genetic algorithm for the quadratic traveling salesman problem Proceedings of the Thirty-Third International Conference on Automated Planning and Scheduling, (343-351)
- Ju X, Rosenberger J, Chen V and Liu F (2022). Global optimization on non-convex two-way interaction truncated linear multivariate adaptive regression splines using mixed integer quadratic programming, Information Sciences: an International Journal, 597:C, (38-52), Online publication date: 1-Jun-2022.
- Ushijima-Mwesigwa H, Shaydulin R, Negre C, Mniszewski S, Alexeev Y and Safro I (2021). Multilevel Combinatorial Optimization across Quantum Architectures, ACM Transactions on Quantum Computing, 2:1, (1-29), Online publication date: 1-Apr-2021.
- Taig E and Ben-Shahar O (2019). Gradient Surfing, Journal of Optimization Theory and Applications, 180:3, (855-878), Online publication date: 1-Mar-2019.
- Calvin J, Gimbutienăź G, Phillips W and źIlinskas A (2018). On convergence rate of a rectangular partition based global optimization algorithm, Journal of Global Optimization, 71:1, (165-191), Online publication date: 1-May-2018.
- Kuno T (2018). A modified simplicial algorithm for convex maximization based on an extension of $$\omega $$ź-subdivision, Journal of Global Optimization, 71:2, (297-311), Online publication date: 1-Jun-2018.
- Costa M, Rocha A and Fernandes E (2018). Filter-based DIRECT method for constrained global optimization, Journal of Global Optimization, 71:3, (517-536), Online publication date: 1-Jul-2018.
- Gimbutas A and źIlinskas A (2018). An algorithm of simplicial Lipschitz optimization with the bi-criteria selection of simplices for the bi-section, Journal of Global Optimization, 71:1, (115-127), Online publication date: 1-May-2018.
- PaulaviăźIus R, Chiter L and źIlinskas J (2018). Global optimization based on bisection of rectangles, function values at diagonals, and a set of Lipschitz constants, Journal of Global Optimization, 71:1, (5-20), Online publication date: 1-May-2018.
- Huyer W and Neumaier A (2018). MINQ8, Computational Optimization and Applications, 69:2, (351-381), Online publication date: 1-Mar-2018.
- Hasan M (2018). An edge-concave underestimator for the global optimization of twice-differentiable nonconvex problems, Journal of Global Optimization, 71:4, (735-752), Online publication date: 1-Aug-2018.
- Diab D and El Hindi K (2018). Using differential evolution for improving distance measures of nominal values, Applied Soft Computing, 64:C, (14-34), Online publication date: 1-Mar-2018.
- Yang I (2022). A dynamic game approach to distributionally robust safety specifications for stochastic systems, Automatica (Journal of IFAC), 94:C, (94-101), Online publication date: 1-Aug-2018.
- Yi R, Liu Y and He Y (2018). Delaunay mesh simplification with differential evolution, ACM Transactions on Graphics, 37:6, (1-12), Online publication date: 31-Dec-2019.
- Belachew M and Gillis N (2017). Solving the Maximum Clique Problem with Symmetric Rank-One Non-negative Matrix Approximation, Journal of Optimization Theory and Applications, 173:1, (279-296), Online publication date: 1-Apr-2017.
- Martinez N, Anahideh H, Rosenberger J, Martinez D, Chen V and Wang B (2017). Global optimization of non-convex piecewise linear regression splines, Journal of Global Optimization, 68:3, (563-586), Online publication date: 1-Jul-2017.
- Albrecht S and Stone P Reasoning about Hypothetical Agent Behaviours and their Parameters Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, (547-555)
- Gergel V, Grishagin V and Gergel A (2016). Adaptive nested optimization scheme for multidimensional global search, Journal of Global Optimization, 66:1, (35-51), Online publication date: 1-Sep-2016.
- Yang G and Nikolova E Approximation algorithms for route planning with nonlinear objectives Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, (3209-3215)
- Bunin G (2016). Extended reverse-convex programming, Journal of Global Optimization, 65:2, (191-229), Online publication date: 1-Jun-2016.
- Gaudioso M, Gruzdeva T and Strekalovsky A (2016). On numerical solving the spherical separability problem, Journal of Global Optimization, 66:1, (21-34), Online publication date: 1-Sep-2016.
- Kuno T and Ishihama T (2016). A generalization of ω-subdivision ensuring convergence of the simplicial algorithm, Computational Optimization and Applications, 64:2, (535-555), Online publication date: 1-Jun-2016.
- Edirisinghe C and Jeong J (2016). An efficient global algorithm for a class of indefinite separable quadratic programs, Mathematical Programming: Series A and B, 158:1-2, (143-173), Online publication date: 1-Jul-2016.
- Yang Y, Zeng W and Meng X (2016). Conformal freeform surfaces, Computer-Aided Design, 81:C, (48-60), Online publication date: 1-Dec-2016.
- Baidas M, Alsusa E and Hamdi K (2016). Power allocation over time-varying multiple-access interference channels, International Journal of Communication Systems, 29:13, (2041-2058), Online publication date: 10-Sep-2016.
- Conca P, Stracquadanio G and Nicosia G Automatic Tuning of Algorithms Through Sensitivity Minimization Revised Selected Papers of the First International Workshop on Machine Learning, Optimization, and Big Data - Volume 9432, (14-25)
- Gorge A, Lisser A and Zorgati R (2015). Generating cutting planes for the semidefinite relaxation of quadratic programs, Computers and Operations Research, 55:C, (65-75), Online publication date: 1-Mar-2015.
- Pillo G, Lucidi S and Rinaldi F (2015). A Derivative-Free Algorithm for Constrained Global Optimization Based on Exact Penalty Functions, Journal of Optimization Theory and Applications, 164:3, (862-882), Online publication date: 1-Mar-2015.
- Cartis C, Fowkes J and Gould N (2015). Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties, Journal of Global Optimization, 61:3, (429-457), Online publication date: 1-Mar-2015.
- Yang Y, Zeng W and Song T (2015). Optimizing conformality of NURBS surfaces by general bilinear transformations, Computer-Aided Design, 63:C, (12-25), Online publication date: 1-Jun-2015.
- Syed M, Georgiev P and Pardalos P (2014). A hierarchical approach for sparse source Blind Signal Separation problem, Computers and Operations Research, 41, (386-398), Online publication date: 1-Jan-2014.
- Lahiouel O, Aridhi H, Zaki M and Tahar S A semi-formal approach for analog circuits behavioral properties verification Proceedings of the 24th edition of the great lakes symposium on VLSI, (247-248)
- Rand G (2013). Book Reviews, Interfaces, 43:1, (99-109), Online publication date: 1-Jan-2013.
- Yang Y, Zeng W, Yang C, Deng B, Meng X and Sitharama Iyengar S (2013). An algorithm to improve parameterizations of rational Bézier surfaces using rational bilinear reparameterization, Computer-Aided Design, 45:3, (628-638), Online publication date: 1-Mar-2013.
- Luo H, Wu H and Liu J (2013). Some Results on Augmented Lagrangians in Constrained Global Optimization via Image Space Analysis, Journal of Optimization Theory and Applications, 159:2, (360-385), Online publication date: 1-Nov-2013.
- Fowkes J, Gould N and Farmer C (2013). A branch and bound algorithm for the global optimization of Hessian Lipschitz continuous functions, Journal of Global Optimization, 56:4, (1791-1815), Online publication date: 1-Aug-2013.
- Badreldin M, Hussein A and Khamis A (2013). A comparative study between optimization and market-based approaches to multi-robot task allocation, Advances in Artificial Intelligence, 2013, (12-12), Online publication date: 1-Jan-2013.
- Huang X and Rubin I (2013). Capacity- and energy-aware activation of sensor nodes for area phenomenon reproduction using wireless network transport, ACM Transactions on Sensor Networks, 9:4, (1-24), Online publication date: 1-Jul-2013.
- Phan D (2012). Lagrangian Duality and Branch-and-Bound Algorithms for Optimal Power Flow, Operations Research, 60:2, (275-285), Online publication date: 1-Mar-2012.
- Stracquadanio G, Pappalardo E and Pardalos P (2012). A Mesh Adaptive Basin Hopping Method for the Design of Circular Antenna Arrays, Journal of Optimization Theory and Applications, 155:3, (1008-1024), Online publication date: 1-Dec-2012.
- Calvin J, Chen Y and źIlinskas A (2012). An Adaptive Univariate Global Optimization Algorithm and Its Convergence Rate for Twice Continuously Differentiable Functions, Journal of Optimization Theory and Applications, 155:2, (628-636), Online publication date: 1-Nov-2012.
- Santis M and Rinaldi F (2012). Continuous Reformulations for Zero---One Programming Problems, Journal of Optimization Theory and Applications, 153:1, (75-84), Online publication date: 1-Apr-2012.
- Hendrix E, Casado L and Amaral P Global optimization simplex bisection revisited based on considerations by reiner horst Proceedings of the 12th international conference on Computational Science and Its Applications - Volume Part III, (159-173)
- Serafino D, Liuzzi G, Piccialli V, Riccio F and Toraldo G (2011). A Modified DIviding RECTangles Algorithm for a Problem in Astrophysics, Journal of Optimization Theory and Applications, 151:1, (175-190), Online publication date: 1-Oct-2011.
- Ashtiani A and Ferreira P (2011). On the Solution of Generalized Multiplicative Extremum Problems, Journal of Optimization Theory and Applications, 149:2, (411-419), Online publication date: 1-May-2011.
- Yang Y and Bai F (2011). An integral function and vector sequence method for unconstrained global optimization, Journal of Global Optimization, 50:2, (293-311), Online publication date: 1-Jun-2011.
- Gao Y, Wu G and Ma W (2010). A new global optimization approach for convex multiplicative programming, Applied Mathematics and Computation, 216:4, (1206-1218), Online publication date: 1-Apr-2010.
- Misener R and Floudas C (2010). Piecewise-Linear Approximations of Multidimensional Functions, Journal of Optimization Theory and Applications, 145:1, (120-147), Online publication date: 1-Apr-2010.
- Horst R (2010). Bisecton by Global Optimization Revisited, Journal of Optimization Theory and Applications, 144:3, (501-510), Online publication date: 1-Mar-2010.
- Yamada S, Tanaka T and Tanino T (2010). Outer Approximation Method Incorporating a Quadratic Approximation for a DC Programming Problem, Journal of Optimization Theory and Applications, 144:1, (156-183), Online publication date: 1-Jan-2010.
- Yang J and Du T A neural network algorithm for solving quadratic programming based on fibonacci method Proceedings of the 7th international conference on Advances in Neural Networks - Volume Part I, (118-125)
- Arulselvan A, Commander C, Elefteriadou L and Pardalos P (2009). Detecting critical nodes in sparse graphs, Computers and Operations Research, 36:7, (2193-2200), Online publication date: 1-Jul-2009.
- Fischione C, Speranzon A, Johansson K and Sangiovanni-Vincentelli A Peer-to-peer estimation over wireless sensor networks via Lipschitz optimization Proceedings of the 2009 International Conference on Information Processing in Sensor Networks, (241-252)
- Mevissen M, Yokoyama K and Takayama N Solutions of polynomial systems derived from the steady cavity flow problem Proceedings of the 2009 international symposium on Symbolic and algebraic computation, (255-262)
- He J, Watson L and Sosonkina M (2009). Algorithm 897, ACM Transactions on Mathematical Software, 36:3, (1-24), Online publication date: 1-Jul-2009.
- Ferrer A and Martínez-Legaz J (2009). Improving the efficiency of DC global optimization methods by improving the DC representation of the objective function, Journal of Global Optimization, 43:4, (513-531), Online publication date: 1-Apr-2009.
- Nahapetyan A and Pardalos P (2008). A bilinear reduction based algorithm for solving capacitated multi-item dynamic pricing problems, Computers and Operations Research, 35:5, (1601-1612), Online publication date: 1-May-2008.
- Zhang H and Wang S (2008). Linearly constrained global optimization via piecewise-linear approximation, Journal of Computational and Applied Mathematics, 214:1, (111-120), Online publication date: 1-Apr-2008.
- Shen P, Li X and Jiao H (2008). Accelerating method of global optimization for signomial geometric programming, Journal of Computational and Applied Mathematics, 214:1, (66-77), Online publication date: 1-Apr-2008.
- Benson H (2008). Global Maximization of a Generalized Concave Multiplicative Function, Journal of Optimization Theory and Applications, 137:1, (105-120), Online publication date: 1-Apr-2008.
- Sigg C and Buhmann J Expectation-maximization for sparse and non-negative PCA Proceedings of the 25th international conference on Machine learning, (960-967)
- Mahmudov E (2008). Sufficient conditions for optimality for differential inclusions of parabolic type and duality, Journal of Global Optimization, 41:1, (31-42), Online publication date: 1-May-2008.
- Liang Y, Zhang L, Li M and Han B (2007). A filled function method for global optimization, Journal of Computational and Applied Mathematics, 205:1, (16-31), Online publication date: 1-Aug-2007.
- Wang W, Shang Y and Zhang L (2007). A filled function method with one parameter for box constrained global optimization, Applied Mathematics and Computation, 194:1, (54-66), Online publication date: 1-Dec-2007.
- Wu Z (2007). Sufficient global optimality conditions for weakly convex minimization problems, Journal of Global Optimization, 39:3, (427-440), Online publication date: 1-Nov-2007.
- Tao Y, Liu G and Chen W (2007). Globally optimal solutions of max---min systems, Journal of Global Optimization, 39:3, (347-363), Online publication date: 1-Nov-2007.
- Shen Z (2007). Integrated Stochastic Supply-Chain Design Models, Computing in Science and Engineering, 9:2, (50-59), Online publication date: 1-Mar-2007.
- Ferzli I, Najm F and Kruse L A geometric approach for early power grid verification using current constraints Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design, (40-47)
- Ferzli I, Najm F and Kruse L Early power grid verification under circuit current uncertainties Proceedings of the 2007 international symposium on Low power electronics and design, (116-121)
- Huang X and Rubin I Capacity and energy aware activation of sensor nodes for area phenomenon using wireless network transport Proceedings of the 2007 international conference on Wireless communications and mobile computing, (463-468)
- Eckstein J and Nediak M (2007). Pivot, Cut, and Dive, Journal of Heuristics, 13:5, (471-503), Online publication date: 1-Oct-2007.
- Xue H, Xu C and Feng Z (2006). Mean-variance portfolio optimal problem under concave transaction cost, Applied Mathematics and Computation, 174:1, (1-12), Online publication date: 1-Mar-2006.
- Banaszek K (2006). Information Gain versus State Disturbance for a Single Qubit, Open Systems & Information Dynamics, 13:1, (1-16), Online publication date: 1-Mar-2006.
- Beliakov G (2005). Universal nonuniform random vector generator based on acceptance-rejection, ACM Transactions on Modeling and Computer Simulation, 15:3, (205-232), Online publication date: 1-Jul-2005.
- Borraz-Sánchez C and Ríos-Mercado R A hybrid meta-heuristic approach for natural gas pipeline network optimization Proceedings of the Second international conference on Hybrid Metaheuristics, (54-65)
- Thoai N, Yamamoto Y and Yoshise A (2005). Global Optimization Method for Solving Mathematical Programs with Linear Complementarity Constraints, Journal of Optimization Theory and Applications, 124:2, (467-490), Online publication date: 1-Feb-2005.
- Osawa K and Aida K Speed-up Techniques for Computation of Markov Chain Model to Find an Optimal Batting Order Proceedings of the Eighth International Conference on High-Performance Computing in Asia-Pacific Region
- Huang H, Liang Z and Pardalos P (2004). Flow Search Approach and New Bounds for the m-Step Linear Conjugate Gradient Algorithm, Journal of Optimization Theory and Applications, 120:1, (53-71), Online publication date: 1-Jan-2004.
- Chaovalitwongse W, Pardalos P, Iasemidis L, Shiau D and Sackellares J Applications of global optimization and dynamical systems to prediction of epileptic seizures Quantitative neuroscience, (1-35)
- Wang G A novel method for parameter optimization in two-dimensional dynamical models Proceedings of the 5th WSEAS International Conference on Applied Mathematics, (1-9)
- Gao D (2004). Canonical Duality Theory and Solutions to Constrained Nonconvex Quadratic Programming, Journal of Global Optimization, 29:4, (377-399), Online publication date: 1-Aug-2004.
- Zhang L, Ng C, Li D and Tian W (2004). A New Filled Function Method for Global Optimization, Journal of Global Optimization, 28:1, (17-43), Online publication date: 1-Jan-2004.
- Wong R, Fu A and Wang K MPIS Proceedings of the Third IEEE International Conference on Data Mining
- Oliveira R and Ferreira P Global optimization of convex multiplicative programs by duality theory Proceedings of the Second international conference on Global Optimization and Constraint Satisfaction, (101-111)
- Xu P (2003). Numerical solution for bounding feasible point sets, Journal of Computational and Applied Mathematics, 156:1, (201-219), Online publication date: 1-Jul-2003.
- Bagirov A and Rubinov A (2003). Cutting Angle Method and a Local Search, Journal of Global Optimization, 27:2-3, (193-213), Online publication date: 1-Nov-2003.
- Vera X, Llosa J and González A Near-optimal padding for removing conflict misses Proceedings of the 15th international conference on Languages and Compilers for Parallel Computing, (329-343)
- Aida K, Futakata Y and Hara S High-Performance Parallel and Distributed Computing for the BMI Eigenvalue Problem Proceedings of the 16th International Parallel and Distributed Processing Symposium
- Fortin D and Tsevendorj I (2002). Piecewise-Convex Maximization Problems, Journal of Global Optimization, 24:1, (61-77), Online publication date: 1-Sep-2002.
- Trafalis T and Kasap S (2002). A novel metaheuristics approach for continuous global optimization, Journal of Global Optimization, 23:2, (171-190), Online publication date: 1-Jun-2002.
- Huang H, Pardalos P and Shen Z (2002). Equivalent formulations and necessary optimality conditions for the Lennard–Jones problem, Journal of Global Optimization, 22:1-4, (97-118), Online publication date: 1-Jan-2002.
- Bomze I (2002). Branch-and-bound approaches to standard quadratic optimization problems, Journal of Global Optimization, 22:1-4, (17-37), Online publication date: 1-Jan-2002.
- Hoai An L and Tao P (2002). D.C. programming approach for multicommodity network optimization problems with step increasing cost functions, Journal of Global Optimization, 22:1-4, (205-232), Online publication date: 1-Jan-2002.
- Brimberg J, Hansen P and Mladenović N (2002). A note on reduction of quadratic and bilinear programs with equality constraints, Journal of Global Optimization, 22:1-4, (39-47), Online publication date: 1-Jan-2002.
- Bradley E, Easley M and Stolle R (2001). Reasoning about nonlinear system identification, Artificial Intelligence, 133:1-2, (139-188), Online publication date: 1-Dec-2001.
- Tsevendorj I (2001). Piecewise-Convex Maximization Problems, Journal of Global Optimization, 21:1, (1-14), Online publication date: 1-Sep-2001.
- Kuznetsova A and Strekalovsky A (2001). On solving the maximum clique problem, Journal of Global Optimization, 21:3, (265-288), Online publication date: 1-Nov-2001.
- Oblow E (2001). SPT, Journal of Global Optimization, 20:2, (191-208), Online publication date: 1-Jun-2001.
- Andersson A and Ygge F (2001). Efficient Resource Allocation with Non-Concave Objective Functions, Computational Optimization and Applications, 20:3, (281-298), Online publication date: 1-Dec-2001.
- Xu Z, Huang H, Pardalos P and Xu C (2001). Filled functions for unconstrained global optimization, Journal of Global Optimization, 20:1, (49-65), Online publication date: 1-May-2001.
- Babayev D and Bell G (2001). An Optimization Problem with a Separable Non-Convex Objective Function and a Linear Constraint, Journal of Heuristics, 7:2, (169-184), Online publication date: 1-Mar-2001.
- Locatelli M and Raber U (2000). Finiteness Result for the Simplicial Branch-and-Bound Algorithm Based on ź-Subdivisions, Journal of Optimization Theory and Applications, 107:1, (81-88), Online publication date: 1-Oct-2000.
- Locatelli M and Raber U (2000). On Convergence of the Simplicial Branch-and-Bound Algorithm Based on ź-Subdivisions, Journal of Optimization Theory and Applications, 107:1, (69-79), Online publication date: 1-Oct-2000.
- Thoai N (2000). Duality Bound Method for the General Quadratic Programming Problem with Quadratic Constraints, Journal of Optimization Theory and Applications, 107:2, (331-354), Online publication date: 1-Nov-2000.
- Nowak I (2000). Dual Bounds and Optimality Cuts for All-Quadratic Programs with Convex Constraints, Journal of Global Optimization, 18:4, (337-356), Online publication date: 1-Dec-2000.
- Bomze I, Dür M, De Klerk E, Roos C, Quist A and Terlaky T (2000). On Copositive Programming and Standard Quadratic Optimization Problems, Journal of Global Optimization, 18:4, (301-320), Online publication date: 1-Dec-2000.
- Thoai N (2000). Conical Algorithm in Global Optimization for Optimizing over Efficient Sets, Journal of Global Optimization, 18:4, (321-336), Online publication date: 1-Dec-2000.
- Carrizosa E, Hamacher H, Klein R and Nickel S (2000). Solving Nonconvex Planar Location Problems by Finite Dominating Sets, Journal of Global Optimization, 18:2, (195-210), Online publication date: 1-Oct-2000.
- Kuno T and Utsunomiya T (2000). A Lagrangian Based Branch-and-Bound Algorithm for Production-transportation Problems, Journal of Global Optimization, 18:1, (59-73), Online publication date: 29-Sep-2000.
- Locatelli M and Thoai N (2000). Finite Exact Branch-and-Bound Algorithms for Concave Minimization over Polytopes, Journal of Global Optimization, 18:2, (107-128), Online publication date: 1-Oct-2000.
- Konno H and Fukaishi K (2000). A Branch and Bound Algorithm for Solving Low Rank Linear Multiplicative and Fractional Programming Problems, Journal of Global Optimization, 18:3, (283-299), Online publication date: 1-Nov-2000.
- Liu D and Zhang X (2000). Test Problem Generator by Neural Network for Algorithms that Try Solving Nonlinear Programming Problems Globally, Journal of Global Optimization, 16:3, (229-243), Online publication date: 1-Mar-2000.
- Horst R and Thoai N (1999). DC Programming, Journal of Optimization Theory and Applications, 103:1, (1-43), Online publication date: 1-Oct-1999.
- Nickel S and Schöbel A (1999). A Geometric Approach to Global Optimization, Journal of Global Optimization, 15:2, (109-126), Online publication date: 1-Sep-1999.
- Lamar B (1999). A Method for Converting a Class of Univariate Functions into D.C. Functions, Journal of Global Optimization, 15:1, (55-71), Online publication date: 1-Jul-1999.
- Khamisov O (1999). On Optimization Properties of Functions, with a Concave Minorant, Journal of Global Optimization, 14:1, (79-101), Online publication date: 1-Jan-1999.
- Benson H (1999). An Outcome Space Branch and Bound-Outer Approximation Algorithm for Convex Multiplicative Programming, Journal of Global Optimization, 15:4, (315-342), Online publication date: 1-Dec-1999.
- Nowak I (1999). A New Semidefinite Programming Bound for Indefinite Quadratic Forms Over a Simplex, Journal of Global Optimization, 14:4, (357-364), Online publication date: 1-Jun-1999.
- Görges C and Ratschek H (1999). Global Interval Methods for Local Nonsmooth Optimization, Journal of Global Optimization, 14:2, (157-179), Online publication date: 1-Mar-1999.
- Thoai N (1998). Global Optimization Techniques for Solving the General Quadratic Integer Programming Problem, Computational Optimization and Applications, 10:2, (149-163), Online publication date: 1-May-1998.
- Raber U (1998). A Simplicial Branch-and-Bound Method for Solving Nonconvex All-Quadratic Programs, Journal of Global Optimization, 13:4, (417-432), Online publication date: 1-Dec-1998.
- Bomze I (1998). On Standard Quadratic Optimization Problems, Journal of Global Optimization, 13:4, (369-387), Online publication date: 1-Dec-1998.
- Strekalovsky A (1998). Global Optimality Conditions for Nonconvex Optimization, Journal of Global Optimization, 12:4, (415-434), Online publication date: 1-Jun-1998.
- Shectman J and Sahinidis N (1998). A Finite Algorithm for Global Minimization ofSeparable Concave Programs, Journal of Global Optimization, 12:1, (1-36), Online publication date: 1-Jan-1998.
- Wellman M and Hu J (1998). Conjectural Equilibrium in Multiagent Learning, Machine Language, 33:2-3, (179-200), Online publication date: 1-Dec-1998.
- Bomze I (1997). Global Escape Strategies for Maximizing QuadraticForms over a Simplex, Journal of Global Optimization, 11:3, (325-338), Online publication date: 1-Oct-1997.
- Mavridou T and Pardalos P (1997). Simulated Annealing and Genetic Algorithms for the Facility LayoutProblem, Computational Optimization and Applications, 7:1, (111-126), Online publication date: 1-Jan-1997.
- Bomze I (1997). Evolution towards the Maximum Clique, Journal of Global Optimization, 10:2, (143-164), Online publication date: 1-Mar-1997.
- Pardalos P, Liu X and Xue G (1997). Protein Conformation of a Lattice Model Using Tabu Search, Journal of Global Optimization, 11:1, (55-68), Online publication date: 1-Jul-1997.
- Sherali H and Smith E (1997). A Global Optimization Approach to a Water Distribution Network DesignProblem, Journal of Global Optimization, 11:2, (107-132), Online publication date: 1-Sep-1997.
- Horst R and Nast M (1996). Linearly constrained global minimization of functions with concave minorants, Journal of Optimization Theory and Applications, 88:3, (751-763), Online publication date: 1-Mar-1996.
Recommendations
An enhanced particle swarm optimization with levy flight for global optimization
Enhanced PSO with levy flight.Random walk of the particles.High convergence rate.Provides solution accuracy and robust. Hüseyin Haklı and Harun Uguz (2014) proposed a novel approach for global function optimization using particle swarm optimization with ...
Non-parametric particle swarm optimization for global optimization
Proposing an improved PSO scheme called non-parametric particle swarm optimization (NP-PSO).Combining local and global topologies with two quadratic interpolation operations to increase the search ability in NP-PSO.Removing PSO parameters in the ...
Bacterial foraging optimization algorithm with particle swarm optimization strategy for global numerical optimization
GEC '09: Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary ComputationIn 2002, K. M. Passino proposed Bacterial Foraging Optimization Algorithm (BFOA) for distributed optimization and control. One of the major driving forces of BFOA is the chemotactic movement of a virtual bacterium that models a trial solution of the ...