Printed from https://ideas.repec.org/s/spr/jglopt3.html
Content
February 2021, Volume 79, Issue 2
- 431-445 A DIRECT-type global optimization algorithm for image registration
by Cuicui Zheng & James Calvin & Craig Gotsman - 447-462 Multistart with early termination of descents
by Antanas Žilinskas & Jonathan Gillard & Megan Scammell & Anatoly Zhigljavsky - 463-502 Production and transport scheduling in flexible job shop manufacturing systems
by Seyed Mahdi Homayouni & Dalila B. M. M. Fontes - 503-520 Nonlinear biobjective optimization: improving the upper envelope using feasible line segments
by Ignacio Araya & Damir Aliquintui & Franco Ardiles & Braulio Lobo
January 2021, Volume 79, Issue 1
- 1-37 A filter proximal bundle method for nonsmooth nonconvex constrained optimization
by Najmeh Hoseini Monjezi & S. Nobakhtian - 39-57 Oscars-ii: an algorithm for bound constrained global optimization
by C. J. Price & M. Reale & B. L. Robertson - 59-85 The exact solution of multiparametric quadratically constrained quadratic programming problems
by Iosif Pappas & Nikolaos A. Diangelakis & Efstratios N. Pistikopoulos - 87-110 Stochastic optimization with adaptive restart: a framework for integrated local and global learning
by Logan Mathesen & Giulia Pedrielli & Szu Hui Ng & Zelda B. Zabinsky - 111-152 Resolving learning rates adaptively by locating stochastic non-negative associated gradient projection points using line searches
by Dominic Kafka & Daniel N. Wilke - 153-190 The extreme rays of the $$6\times 6$$ 6 × 6 copositive cone
by Andrey Afonin & Roland Hildebrand & Peter J. C. Dickinson - 191-202 Karush–Kuhn–Tucker type optimality condition for quasiconvex programming in terms of Greenberg–Pierskalla subdifferential
by Satoshi Suzuki - 203-231 Second-order KKT optimality conditions for multiobjective discrete optimal control problems
by Nguyen Thi Toan & Le Quang Thuy & Nguyen Tuyen & Yi-Bin Xiao - 233-256 A scalarization scheme for binary relations with applications to set-valued and robust optimization
by C. Gutiérrez & L. Huerga & E. Köbis & C. Tammer - 257-277 Weak convergence of an extended splitting method for monotone inclusions
by Yunda Dong
December 2020, Volume 78, Issue 4
- 651-670 Saddle point approximation approaches for two-stage robust optimization problems
by Ning Zhang & Chang Fang - 671-691 Strategic decisions of sales and pay-per-use rentals under incomplete product availability
by Ping Yan & Jun Pei & Altannar Chinchuluun - 693-715 Parallel-batching scheduling with nonlinear processing times on a single and unrelated parallel machines
by Min Kong & Xinbao Liu & Jun Pei & Panos M. Pardalos & Nenad Mladenovic - 717-742 Parallel-machine group scheduling with inclusive processing set restrictions, outsourcing option and serial-batching under the effect of step-deterioration
by Baoyu Liao & Qingru Song & Jun Pei & Shanlin Yang & Panos M. Pardalos - 743-761 High-end weapon equipment portfolio selection based on a heterogeneous network model
by Jichao Li & Bingfeng Ge & Jiang Jiang & Kewei Yang & Yingwu Chen - 763-789 Fast algorithms for sparse portfolio selection considering industries and investment styles
by Zhi-Long Dong & Fengmin Xu & Yu-Hong Dai - 791-812 A heuristic and metaheuristic approach to the static weapon target assignment problem
by Alexander G. Kline & Darryl K. Ahner & Brian J. Lunday
November 2020, Volume 78, Issue 3
- 397-422 Consistency bounds and support recovery of d-stationary solutions of sparse sample average approximations
by Miju Ahn - 423-451 Penalized semidefinite programming for quadratically-constrained quadratic optimization
by Ramtin Madani & Mohsen Kheirandishfard & Javad Lavaei & Alper Atamtürk - 453-482 Outer space branch and bound algorithm for solving linear multiplicative programming problems
by Peiping Shen & Kaimin Wang & Ting Lu - 483-506 Gaussian process optimization with failures: classification and convergence proof
by François Bachoc & Céline Helbert & Victor Picheny - 507-544 Expected improvement for expensive optimization: a review
by Dawei Zhan & Huanlai Xing - 545-562 Geoffrion’s proper efficiency in linear fractional vector optimization with unbounded constraint sets
by N. T. T. Huong & J.-C. Yao & N. D. Yen - 563-580 Stability of efficient solutions to set optimization problems
by L. Q. Anh & T. Q. Duy & D. V. Hien - 581-596 On the sensitivity of Pareto efficiency in set-valued optimization problems
by Marius Durea & Radu Strugariu - 597-626 Portfolio optimization with two coherent risk measures
by Tahsin Deniz Aktürk & Çağın Ararat - 627-649 Refugee migration networks and regulations: a multiclass, multipath variational inequality framework
by Anna Nagurney & Patrizia Daniele & Ladimer S. Nagurney
October 2020, Volume 78, Issue 2
- 239-240 Preface to the special issue “ICVNS 2018”
by Angelo Sifaleras & Nenad Mladenović & Panos M. Pardalos - 241-270 Improved metaheuristics for the quartet method of hierarchical clustering
by Sergio Consoli & Jan Korst & Steffen Pauws & Gijs Geleijnse - 271-294 The continuous single-source capacitated multi-facility Weber problem with setup costs: formulation and solution methods
by Chandra Ade Irawan & Said Salhi & Kusmaningrum Soemadi - 295-325 GRASP with Variable Neighborhood Descent for the online order batching problem
by Sergio Gil-Borrás & Eduardo G. Pardo & Antonio Alonso-Ayuso & Abraham Duarte - 327-348 Cooperative versus non-cooperative parallel variable neighborhood search strategies: a case study on the capacitated vehicle routing problem
by Panagiotis Kalatzantonakis & Angelo Sifaleras & Nikolaos Samaras - 349-373 Modelling and solving the multi-quays berth allocation and crane assignment problem with availability constraints
by Issam Krimi & Raca Todosijević & Rachid Benmansour & Mustapha Ratli & Abdessamad Ait Cadi & Afaf Aloullal - 375-396 Revenue maximization of Internet of things provider using variable neighbourhood search
by Vesna Radonjić Ɖogatović & Marko Ɖogatović & Milorad Stanojević & Nenad Mladenović
September 2020, Volume 78, Issue 1
- 1-36 DOMINO: Data-driven Optimization of bi-level Mixed-Integer NOnlinear Problems
by Burcu Beykal & Styliani Avraamidou & Ioannis P. E. Pistikopoulos & Melis Onel & Efstratios N. Pistikopoulos - 37-47 Solving polyhedral d.c. optimization problems via concave minimization
by Simeon vom Dahl & Andreas Löhne - 49-68 A general asymptotic function with applications in nonconvex optimization
by Nicolas Hadjisavvas & Felipe Lara & Dinh The Luc - 69-89 Global complexity analysis of inexact successive quadratic approximation methods for regularized optimization under mild assumptions
by Wei Peng & Hui Zhang & Xiaoya Zhang & Lizhi Cheng - 91-106 Two modified extragradient algorithms for solving variational inequalities
by Trinh Ngoc Hai - 107-136 A difference-of-convex approach for split feasibility with applications to matrix factorizations and outlier detection
by Chen Chen & Ting Kei Pong & Lulin Tan & Liaoyuan Zeng - 137-160 Development of an adaptive infill criterion for constrained multi-objective asynchronous surrogate-based optimization
by Jolan Wauters & Andy Keane & Joris Degroote - 161-179 On the relation between the extended supporting hyperplane algorithm and Kelley’s cutting plane algorithm
by Felipe Serrano & Robert Schwarz & Ambros Gleixner - 181-205 Relaxed constant positive linear dependence constraint qualification and its application to bilevel programs
by Mengwei Xu & Jane J. Ye - 207-238 Generalized risk parity portfolio optimization: an ADMM approach
by Giorgio Costa & Roy H. Kwon
August 2020, Volume 77, Issue 4
- 687-714 An enhanced logical benders approach for linear programs with complementarity constraints
by Francisco Jara-Moroni & John E. Mitchell & Jong-Shi Pang & Andreas Wächter - 715-742 An inner approximation method to compute the weight set decomposition of a triobjective mixed-integer problem
by Pascal Halffmann & Tobias Dietz & Anthony Przybylski & Stefan Ruzika - 743-776 Delaunay-based derivative-free optimization via global surrogates. Part III: nonconvex constraints
by Ryan Alimo & Pooriya Beyhaghi & Thomas R. Bewley - 777-805 Filter-based stochastic algorithm for global optimization
by M. Joseane F. G. Macêdo & Elizabeth W. Karas & M. Fernanda P. Costa & Ana Maria A. C. Rocha - 807-824 Solution maps of polynomial variational inequalities
by Vu Trung Hieu - 825-852 A sparse chance constrained portfolio selection model with multiple constraints
by Zhiping Chen & Shen Peng & Abdel Lisser - 853-893 A stochastic approach to full inverse treatment planning for charged-particle therapy
by Marc C. Robini & Feng Yang & Yuemin Zhu - 895-918 Capacitated assortment and price optimization under the nested logit model
by Rui Chen & Hai Jiang - 919-948 Finding optimal points for expensive functions using adaptive RBF-based surrogate model via uncertainty quantification
by Ray-Bing Chen & Yuan Wang & C. F. Jeff Wu - 949-973 A biased random-key genetic algorithm for routing and wavelength assignment under a sliding scheduled traffic model
by Bruno Q. Pinto & Celso C. Ribeiro & Isabel Rosseti & Thiago F. Noronha
July 2020, Volume 77, Issue 3
- 425-454 Optimality-based domain reduction for inequality-constrained NLP and MINLP problems
by Yi Zhang & Nikolaos V. Sahinidis & Carlos Nohra & Gang Rong - 455-486 Mathematical programming formulations for piecewise polynomial functions
by Bjarne Grimstad & Brage R. Knudsen - 487-512 Global dynamic optimization using edge-concave underestimator
by Ishan Bajaj & M. M. Faruque Hasan - 513-541 Doubly nonnegative relaxations are equivalent to completely positive reformulations of quadratic optimization problems with block-clique graph structures
by Sunyoung Kim & Masakazu Kojima & Kim-Chuan Toh - 543-574 Subset selection for multiple linear regression via optimization
by Young Woong Park & Diego Klabjan - 575-602 Primal-dual analysis for online interval scheduling problems
by Ge Yu & Sheldon H. Jacobson - 603-625 Preprocessing algorithm and tightening constraints for multiperiod blend scheduling: cost minimization
by Yifu Chen & Christos T. Maravelias - 627-641 Characterization of the weakly efficient solutions in nonsmooth quasiconvex multiobjective optimization
by Nader Kanzi & Majid Soleimani-damaneh - 643-660 Damped Newton’s method on Riemannian manifolds
by Marcio Antônio de A. Bortoloti & Teles A. Fernandes & Orizon P. Ferreira & Jinyun Yuan - 661-685 Limiting Subdifferential Calculus and Perturbed Distance Function in Riemannian Manifolds
by M. Farrokhiniya & A. Barani
June 2020, Volume 77, Issue 2
- 197-225 New bounding schemes and algorithmic options for the Branch-and-Sandwich algorithm
by R. Paulavičius & C. S. Adjiman - 227-272 Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem
by Santanu S. Dey & Burak Kocuk & Asteroide Santana - 273-287 Sequential characterizations of approximate solutions in convex vector optimization problems with set-valued maps
by Nithirat Sisarat & Rabian Wangkeeree & Tamaki Tanaka - 289-300 Order cancellation law in the family of bounded convex sets
by J. Grzybowski & R. Urbański - 301-318 Globally minimizing the sum of a convex–concave fraction and a convex function based on wave-curve bounds
by Yong Xia & Longfei Wang & Xiaohui Wang - 319-340 Approximation algorithms for capacitated partial inverse maximum spanning tree problem
by Xianyue Li & Zhao Zhang & Ruowang Yang & Heping Zhang & Ding-Zhu Du - 341-359 An exact completely positive programming formulation for the discrete ordered median problem: an extended version
by J. Puerto - 361-382 Accelerated sampling Kaczmarz Motzkin algorithm for the linear feasibility problem
by Md Sarowar Morshed & Md Saiful Islam & Md. Noor-E-Alam - 383-403 An enhanced formulation for solving graph coloring problems with the Douglas–Rachford algorithm
by Francisco J. Aragón Artacho & Rubén Campoy & Veit Elser - 405-424 Linear conditioning, weak sharpness and finite convergence for equilibrium problems
by Luong Nguyen & Qamrul Hasan Ansari & Xiaolong Qin
May 2020, Volume 77, Issue 1
- 1-2 Preface: Special issue Europt 2018
by Eligius M. T. Hendrix & Leocadio G. Casado - 3-25 An algorithmic approach to multiobjective optimization with decision uncertainty
by Gabriele Eichfelder & Julia Niebling & Stefan Rocktäschel - 27-52 On generating the set of nondominated solutions of a linear programming problem with parameterized fuzzy numbers
by Manuel Arana-Jiménez & Carmen Sánchez-Gil - 53-73 Distributed algorithms for convex problems with linear coupling constraints
by Tommaso Colombo & Simone Sagratella - 75-96 The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming
by Pavlo Muts & Ivo Nowak & Eligius M. T. Hendrix - 97-124 Block layer decomposition schemes for training deep neural networks
by Laura Palagi & Ruggiero Seccia - 125-141 On ill-posedness and stability of tensor variational inequalities: application to an economic equilibrium
by Annamaria Barbagallo & Serena Guarino Lo Bianco - 143-155 Optimality conditions for convex problems on intersections of non necessarily convex sets
by E. Allevi & J. E. Martínez-Legaz & R. Riccardi - 157-173 Global optimization of grillage-type foundations using a distributed genetic algorithm
by Mikalojus Ramanauskas & Dmitrij Šešok & Julius Žilinskas & Vadimas Starikovičius & Arnas Kačeniauskas & Rimantas Belevičius - 175-196 Packing ovals in optimized regular polygons
by Frank J. Kampas & János D. Pintér & Ignacio Castillo
April 2020, Volume 76, Issue 4
- 661-663 Preface: special issue of MOA 2018
by Ya-Feng Liu & Fengmin Xu & Neng Fan & Jiming Peng - 665-693 A hybrid Bregman alternating direction method of multipliers for the linearly constrained difference-of-convex problems
by Kai Tu & Haibin Zhang & Huan Gao & Junkai Feng - 695-708 The seeding algorithms for spherical k-means clustering
by Min Li & Dachuan Xu & Dongmei Zhang & Juan Zou - 709-728 A Euclidean distance matrix model for protein molecular conformation
by Fengzhen Zhai & Qingna Li - 729-743 Non-submodular maximization on massive data streams
by Yijing Wang & Dachuan Xu & Yishui Wang & Dongmei Zhang - 745-768 A class of exact penalty functions and penalty algorithms for nonsmooth constrained optimization problems
by Qian Liu & Yuqing Xu & Yang Zhou - 769-791 An active set Barzilar–Borwein algorithm for $$l_{0}$$l0 regularized optimization
by Wanyou Cheng & Zixin Chen & Qingjie Hu - 793-818 An ADMM-based location–allocation algorithm for nonconvex constrained multi-source Weber problem under gauge
by Jianlin Jiang & Su Zhang & Yibing Lv & Xin Du & Ziwei Yan - 819-840 Accelerated iterative hard thresholding algorithm for $$l_0$$l0 regularized regression problem
by Fan Wu & Wei Bian - 841-861 A derivative-free algorithm for spherically constrained optimization
by Min Xi & Wenyu Sun & Yannan Chen & Hailin Sun - 863-887 A Gauss–Seidel type inertial proximal alternating linearized minimization for a class of nonconvex optimization problems
by Xue Gao & Xingju Cai & Deren Han - 889-911 A descent cautious BFGS method for computing US-eigenvalues of symmetric complex tensors
by Minru Bai & Jing Zhao & ZhangHui Zhang - 913-932 Set-completely-positive representations and cuts for the max-cut polytope and the unit modulus lifting
by Florian Jarre & Felix Lieder & Ya-Feng Liu & Cheng Lu
March 2020, Volume 76, Issue 3
- 453-454 Preface
by Alexander Kononov & Alexander Strekalovsky & Mikhail Posypkin & Artem Pyatkin - 455-470 Cooperation in dynamic multicriteria games with random horizons
by Anna N. Rettieva - 471-490 Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost
by Akiyoshi Shioura & Natalia V. Shakhlevich & Vitaly A. Strusevich - 491-497 Approximating the 2-machine flow shop problem with exact delays taking two values
by Alexander Ageev - 499-518 A model for optimization of transport infrastructure for some homogeneous goods markets
by Alexander Vasin & Olesya Grigoryeva & Nikita Tsyganov - 519-531 A special three-level optimization problem
by S. Dempe & O. Khamisov & Yu. Kochetov - 533-543 Extension technology and extrema selections in a stochastic multistart algorithm for optimal control problems
by Alexander Yu. Gornov & Tatiana S. Zarodnyuk & Anton S. Anikin & Evgeniya A. Finkelstein - 545-562 The maximum independent union of cliques problem: complexity and exact approaches
by Zeynep Ertem & Eugene Lykhovyd & Yiming Wang & Sergiy Butenko - 563-574 Multidimensional frontier visualization based on optimization methods using parallel computations
by Alexander P. Afanasiev & Vladimir E. Krivonozhko & Andrey V. Lychev & Oleg V. Sukhoroslov - 575-586 Consensus and balancing on the three-sphere
by Aladin Crnkić & Vladimir Jaćimović - 587-612 On feedback strengthening of the maximum principle for measure differential equations
by Maxim Staritsyn & Stepan Sorokin - 613-623 Sparse solutions of optimal control via Newton method for under-determined systems
by Boris Polyak & Andrey Tremba - 625-644 Optimality conditions for optimal impulsive control problems with multipoint state constraints
by Olga N. Samsonyuk - 645-660 A puzzled driver is a better driver: enforcing speed limits using a randomization strategy
by Michael Dreyfuss & Irit Nowik
February 2020, Volume 76, Issue 2
- 243-244 Multi-objective optimization models in finance and investments
by Michalis Doumpos & Constantin Zopounidis - 245-265 An optimization–diversification approach to portfolio selection
by Francesco Cesarone & Andrea Scozzari & Fabio Tardella - 267-293 Global minimum variance portfolios under uncertainty: a robust optimization approach
by Sandra Caçador & Joana Matos Dias & Pedro Godinho - 295-315 Preference-based evolutionary multi-objective optimization for portfolio selection: a new credibilistic model under investor preferences
by Ana B. Ruiz & Rubén Saborido & José D. Bermúdez & Mariano Luque & Enriqueta Vercher - 317-331 Tailor-made thematic portfolios: a core satellite optimization
by Florian Methling & Rüdiger Nitzsch - 333-346 A stochastic goal programming model to derive stable cash management policies
by Francisco Salas-Molina & Juan A. Rodriguez-Aguilar & David Pla-Santamaria - 347-382 The joint replenishment problem with trade credits
by Jen-Yen Lin & Ming-Jong Yao - 383-405 Inner approximating the completely positive cone via the cone of scaled diagonally dominant matrices
by João Gouveia & Ting Kei Pong & Mina Saee - 407-431 Characterization of generalized FJ and KKT conditions in nonsmooth nonconvex optimization
by Javad Koushki & Majid Soleimani-damaneh - 433-452 Convergence analysis of a projection algorithm for variational inequality problems
by Biao Qu & Changyu Wang & Fanwen Meng
January 2020, Volume 76, Issue 1
- 1-24 Convex envelope of bivariate cubic functions over rectangular regions
by Marco Locatelli - 25-55 New global optimality conditions for nonsmooth DC optimization problems
by M. V. Dolgopolik - 57-67 Optimality conditions for an exhausterable function on an exhausterable set
by Majid E. Abbasov - 69-90 On the choice of the low-dimensional domain for global optimization via random embeddings
by Mickaël Binois & David Ginsbourger & Olivier Roustant - 91-120 Steklov regularization and trajectory methods for univariate global optimization
by Orhan Arıkan & Regina S. Burachik & C. Yalçın Kaya - 121-135 Strong duality in minimizing a quadratic form subject to two homogeneous quadratic inequalities over the unit sphere
by Van-Bong Nguyen & Thi Ngan Nguyen & Ruey-Lin Sheu - 137-153 A residual-based algorithm for solving a class of structured nonsmooth optimization problems
by Lei Wu - 155-188 The decompositions with respect to two core non-symmetric cones
by Yue Lu & Ching-Yu Yang & Jein-Shan Chen & Hou-Duo Qi - 189-209 Solving k-center problems involving sets based on optimization techniques
by Nguyen Thai An & Nguyen Mau Nam & Xiaolong Qin - 211-241 Multimode resource-constrained project scheduling in flexible projects
by Zsolt T. Kosztyán & István Szalkai
December 2019, Volume 75, Issue 4
- 885-919 A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs
by T. D. Chuong & V. Jeyakumar & G. Li - 921-947 A finite $$\epsilon $$ϵ-convergence algorithm for two-stage stochastic convex nonlinear programs with mixed-binary first and second-stage variables
by Can Li & Ignacio E. Grossmann - 949-971 A manifold-based approach to sparse global constraint satisfaction problems
by Ali Baharev & Arnold Neumaier & Hermann Schichl - 973-1002 Noisy Euclidean distance matrix completion with a single missing node
by Stefan Sremac & Fei Wang & Henry Wolkowicz & Lucas Pettersson - 1003-1028 Incremental quasi-subgradient methods for minimizing the sum of quasi-convex functions
by Yaohua Hu & Carisa Kwok Wai Yu & Xiaoqi Yang - 1029-1060 Inexact proximal $$\epsilon $$ϵ-subgradient methods for composite convex optimization problems
by R. Díaz Millán & M. Pentón Machado - 1061-1077 Stability of a convex feasibility problem
by Carlo Alberto Bernardi & Enrico Miglierina & Elena Molho - 1079-1109 Surrogate-assisted Bounding-Box approach for optimization problems with tunable objectives fidelity
by M. Rivier & P. M. Congedo - 1111-1131 Online hole healing for sensor coverage
by Zhao Zhang & Zaixin Lu & Xianyue Li & Xiaohui Huang & Ding-Zhu Du - 1133-1146 Approximation algorithm for the partial set multi-cover problem
by Yishuo Shi & Yingli Ran & Zhao Zhang & James Willson & Guangmo Tong & Ding-Zhu Du
November 2019, Volume 75, Issue 3
- 565-593 Tighter McCormick relaxations through subgradient propagation
by Jaromił Najman & Alexander Mitsos - 595-629 A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs
by Emmanuel Ogbe & Xiang Li - 631-654 Solving pooling problems with time discretization by LP and SOCP relaxations and rescheduling methods
by Masaki Kimizuka & Sunyoung Kim & Makoto Yamashita - 655-681 A new algorithm for concave quadratic programming
by Moslem Zamani - 683-733 Solving the equality-constrained minimization problem of polynomial functions
by Shuijing Xiao & Guangxing Zeng - 735-766 Sharp upper and lower bounds for maximum likelihood solutions to random Gaussian bilateral inequality systems
by Michel Minoux & Riadh Zorgati - 767-787 On the convergence of the iterates of proximal gradient algorithm with extrapolation for convex nonsmooth minimization problems
by Bo Wen & Xiaoping Xue - 789-811 Generalized polyhedral convex optimization problems
by Nguyen Ngoc Luan & Jen-Chih Yao - 813-831 Convergence and correctness of belief propagation for the Chinese postman problem
by Guowei Dai & Fengwei Li & Yuefang Sun & Dachuan Xu & Xiaoyan Zhang - 833-849 Parametric monotone function maximization with matroid constraints
by Suning Gong & Qingqin Nong & Wenjing Liu & Qizhi Fang - 851-883 Systemic risk governance in a dynamical model of a banking system
by Lorella Fatone & Francesca Mariani
October 2019, Volume 75, Issue 2
- 227-245 Nonconvex min–max fractional quadratic problems under quadratic constraints: copositive relaxations
by Paula Alexandra Amaral & Immanuel M. Bomze - 247-272 A generalized Benders decomposition-based branch and cut algorithm for two-stage stochastic programs with nonconvex constraints and mixed-binary first and second stage variables
by Can Li & Ignacio E. Grossmann - 273-339 Fractional 0–1 programs: links between mixed-integer linear and conic quadratic formulations
by Erfan Mehmanchi & Andrés Gómez & Oleg A. Prokopyev - 341-392 Discretization-based algorithms for generalized semi-infinite and bilevel programs with coupling equality constraints
by Hatim Djelassi & Moll Glass & Alexander Mitsos - 393-416 A scalable global optimization algorithm for stochastic nonlinear programs
by Yankai Cao & Victor M. Zavala - 417-437 A hierarchy of semidefinite relaxations for completely positive tensor optimization problems
by Anwa Zhou & Jinyan Fan - 439-460 Global supply chain networks and tariff rate quotas: equilibrium analysis with application to agricultural products
by Anna Nagurney & Deniz Besik & Ladimer S. Nagurney - 461-494 Second order cone constrained convex relaxations for nonconvex quadratically constrained quadratic programming
by Rujun Jiang & Duan Li - 495-522 Packing ellipses in an optimized convex polygon
by A. Pankratov & T. Romanova & I. Litvinchev - 523-563 Proximal bundle methods for nonsmooth DC programming
by Welington Oliveira
September 2019, Volume 75, Issue 1
- 1-2 Preface on the Special Issue Global Optimization with Multiple Criteria: Theory, Methods and Applications
by Kaisa Miettinen & Francisco Ruiz - 3-34 Efficient computation of expected hypervolume improvement using box decomposition algorithms
by Kaifeng Yang & Michael Emmerich & André Deutz & Thomas Bäck - 35-62 An exact parallel objective space decomposition algorithm for solving multi-objective integer programming problems
by Ozgu Turgut & Evrim Dalkiran & Alper E. Murat - 63-90 Nonmonotone line searches for unconstrained multiobjective optimization problems
by Kanako Mita & Ellen H. Fukuda & Nobuo Yamashita - 91-110 Nonlinear biobjective optimization: improvements to interval branch & bound algorithms
by Ignacio Araya & Jose Campusano & Damir Aliquintui - 111-129 Necessary conditions for weak efficiency for nonsmooth degenerate multiobjective optimization problems
by Elena Constantin - 131-141 Weak minimal elements and weak minimal solutions of a nonconvex set-valued optimization problem
by M. Chinaie & F. Fakhar & M. Fakhar & H. R. Hajisharifi - 143-161 Coherent weights for pairwise comparison matrices and a mixed-integer linear programming problem
by Bice Cavallo - 163-176 A coercivity condition for nonmonotone quasiequilibria on finite-dimensional spaces
by M. Castellani & M. Giuli - 177-197 Quasi-equilibrium problems with non-self constraint map
by John Cotrina & Javier Zúñiga - 199-225 Trajectory optimization using quantum computing
by Alok Shukla & Prakash Vedula
August 2019, Volume 74, Issue 4
- 597-598 Preface
by Sergiy Butenko & Efstratios N. Pistikopoulos - 599-609 Bi-objective decision making in global optimization based on statistical models
by Antanas Žilinskas & James Calvin - 611-637 Tuning BARON using derivative-free optimization algorithms
by Jianfeng Liu & Nikolaos Ploskas & Nikolaos V. Sahinidis - 639-675 An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs
by Harsha Nagarajan & Mowen Lu & Site Wang & Russell Bent & Kaarthik Sundar - 677-703 On tightness and anchoring of McCormick and other relaxations
by Jaromił Najman & Alexander Mitsos - 705-735 A multi-term, polyhedral relaxation of a 0–1 multilinear function for Boolean logical pattern generation
by Kedong Yan & Hong Seo Ryoo - 737-751 Geometric conditions of reduction of exhausters
by Majid E. Abbasov - 753-782 Invex optimization revisited
by Ksenia Bestuzheva & Hassan Hijazi - 783-801 On the chance-constrained minimum spanning k-core problem
by Juan Ma & Balabhaskar Balasundaram - 803-838 Critical nodes in interdependent networks with deterministic and probabilistic cascading failures
by Alexander Veremyev & Konstantin Pavlikov & Eduardo L. Pasiliao & My T. Thai & Vladimir Boginski - 839-859 A cutting plane method for risk-constrained traveling salesman problem with random arc costs
by Zhouchun Huang & Qipeng Phil Zheng & Eduardo Pasiliao & Vladimir Boginski & Tao Zhang - 861-877 Hybrid clustering based on content and connection structure using joint nonnegative matrix factorization
by Rundong Du & Barry Drake & Haesun Park - 879-908 Joint production and transportation scheduling in flexible manufacturing systems
by Dalila B. M. M. Fontes & Seyed Mahdi Homayouni - 909-932 Local search approximation algorithms for the sum of squares facility location problems
by Dongmei Zhang & Dachuan Xu & Yishui Wang & Peng Zhang & Zhenning Zhang
July 2019, Volume 74, Issue 3
- 417-442 Facets of a mixed-integer bilinear covering set with bounds on variables
by Hamidur Rahman & Ashutosh Mahajan - 443-465 Multi-parametric global optimization approach for tri-level mixed-integer linear optimization problems
by Styliani Avraamidou & Efstratios N. Pistikopoulos - 467-476 Large proper gaps in bin packing and dual bin packing problems
by Vadim M. Kartak & Artem V. Ripatti - 477-493 Solving the multistage PMU placement problem by integer programming and equivalent network design model
by Ou Sun & Neng Fan - 495-522 Multi-objective unconstrained combinatorial optimization: a polynomial bound on the number of extreme supported solutions
by Britta Schulze & Kathrin Klamroth & Michael Stiglmayr - 523-548 On seeking efficient Pareto optimal points in multi-player minimum cost flow problems with application to transportation systems
by Shuvomoy Das Gupta & Lacra Pavel - 549-564 Variable neighborhood search for stochastic linear programming problem with quantile criterion
by Sergey V. Ivanov & Andrey I. Kibzun & Nenad Mladenović & Dragan Urošević