for Journals by Title or ISSN
for Articles by Keywords
help
  Subjects -> ENGINEERING (Total: 2258 journals)
    - CHEMICAL ENGINEERING (190 journals)
    - CIVIL ENGINEERING (177 journals)
    - ELECTRICAL ENGINEERING (99 journals)
    - ENGINEERING (1203 journals)
    - ENGINEERING MECHANICS AND MATERIALS (384 journals)
    - HYDRAULIC ENGINEERING (55 journals)
    - INDUSTRIAL ENGINEERING (60 journals)
    - MECHANICAL ENGINEERING (90 journals)

ENGINEERING (1203 journals)            First | 1 2 3 4 5 6 7 | Last

Showing 1001 - 1200 of 1205 Journals sorted alphabetically
Propellants, Explosives, Pyrotechnics     Hybrid Journal   (Followers: 252)
Propulsion and Power Research     Open Access   (Followers: 19)
Purinergic Signalling     Hybrid Journal   (Followers: 1)
Quaderns d’Història de l’Enginyeria     Open Access  
Quality and Reliability Engineering International     Hybrid Journal   (Followers: 11)
Quality Engineering     Hybrid Journal   (Followers: 9)
Radiochimica Acta     Hybrid Journal   (Followers: 5)
Rapid Prototyping Journal     Hybrid Journal   (Followers: 2)
Rare Metals     Hybrid Journal  
Reactive and Functional Polymers     Hybrid Journal   (Followers: 5)
Recent Patents on Engineering     Full-text available via subscription   (Followers: 3)
Recent Patents on Nanotechnology     Full-text available via subscription   (Followers: 2)
Recherche Transports Sécurité     Hybrid Journal   (Followers: 1)
Redes de Ingeniería     Open Access  
Regional Maritime University Journal     Full-text available via subscription   (Followers: 2)
Regular and Chaotic Dynamics     Hybrid Journal  
Rem : Revista Escola de Minas     Open Access   (Followers: 1)
Remote Sensing     Open Access   (Followers: 31)
Remote Sensing Letters     Hybrid Journal   (Followers: 32)
Requirements Engineering     Hybrid Journal   (Followers: 3)
Research Ideas and Outcomes     Open Access  
Research in Engineering Design     Hybrid Journal   (Followers: 10)
Research Journal of Nanoscience and Nanotechnology     Open Access   (Followers: 2)
Research Works of Air Force Institute of Technology     Open Access   (Followers: 1)
Resonance     Hybrid Journal   (Followers: 23)
Review of Symbolic Logic     Full-text available via subscription   (Followers: 1)
Reviews in Advanced Sciences and Engineering     Partially Free   (Followers: 2)
Revista AIDIS de Ingeniería y Ciencias Ambientales. Investigación, desarrollo y práctica     Open Access  
Revista Brasileira de Engenharia Agrícola e Ambiental     Open Access   (Followers: 1)
Revista Ciencias e Ingeniería al Día     Open Access  
Revista CINTEX     Open Access  
Revista Cubana de Ingeniería     Open Access  
Revista de Engenharia da Universidade Católica de Petrópolis     Open Access  
Revista de Ingeniería     Open Access  
Revista de Ingenieria Sismica     Open Access  
Revista EIA     Open Access   (Followers: 1)
Revista Facultad de Ingenieria - Universidad de Tarapaca     Open Access  
Revista Facultad de Ingeniería Universidad de Antioquia     Open Access   (Followers: 1)
Revista Iberoamericana de Automática e Informática Industrial RIAI     Open Access  
Revista Informador Técnico     Open Access   (Followers: 1)
Revista Ingenieria de Construcción     Open Access  
Revista Internacional de Métodos Numéricos para Cálculo y Diseño en Ingeniería     Open Access  
Revista Logos Ciencia & Tecnología     Open Access  
Revista Petra     Open Access  
Revue de Métallurgie     Full-text available via subscription  
Russian Engineering Research     Hybrid Journal  
Russian Journal of Non-Ferrous Metals     Hybrid Journal   (Followers: 25)
Russian Microelectronics     Hybrid Journal   (Followers: 1)
Sadhana     Open Access   (Followers: 6)
Safety Science     Hybrid Journal   (Followers: 19)
Scholedge International Journal of Multidisciplinary & Allied Studies     Open Access   (Followers: 2)
Science & Technique     Open Access  
Science and Engineering Ethics     Hybrid Journal   (Followers: 6)
Science and Technology     Open Access   (Followers: 2)
Science China Technological Sciences     Hybrid Journal  
Science in Context     Hybrid Journal   (Followers: 1)
Science Journal of Volgograd State University. Technology and innovations     Open Access  
Science Progress     Full-text available via subscription   (Followers: 3)
Scientia cum Industria     Open Access  
Scientific Journal of Control Engineering     Open Access   (Followers: 1)
Scientific Journal of Pure and Applied Sciences     Open Access   (Followers: 1)
Scientific Journal of Review     Open Access  
Sealing Technology     Full-text available via subscription   (Followers: 1)
Securitas Vialis     Hybrid Journal  
Security and Communication Networks     Hybrid Journal   (Followers: 3)
Selcuk University Journal of Engineering, Science and Technology     Open Access   (Followers: 1)
Selected Topics in Applied Earth Observations and Remote Sensing, IEEE Journal of     Hybrid Journal   (Followers: 41)
Semiconductors     Hybrid Journal  
Semiconductors and Semimetals     Full-text available via subscription  
Sensing and Imaging : An International Journal     Hybrid Journal   (Followers: 1)
Sensor Letters     Full-text available via subscription   (Followers: 1)
Sensors     Open Access   (Followers: 12)
Separation and Purification Technology     Hybrid Journal   (Followers: 10)
Services Computing, IEEE Transactions on     Hybrid Journal   (Followers: 4)
Shock and Vibration     Hybrid Journal   (Followers: 8)
SIAM Journal on Applied Dynamical Systems     Hybrid Journal   (Followers: 2)
SIAM Journal on Mathematical Analysis     Hybrid Journal   (Followers: 3)
SIAM Journal on Matrix Analysis and Applications     Hybrid Journal   (Followers: 1)
SIAM Journal on Numerical Analysis     Hybrid Journal   (Followers: 4)
SIAM Journal on Optimization     Hybrid Journal   (Followers: 8)
SIAM Review     Hybrid Journal   (Followers: 6)
SILICON     Hybrid Journal  
Sistemas & Telemática     Open Access   (Followers: 1)
Sleep and Biological Rhythms     Hybrid Journal   (Followers: 4)
Small     Hybrid Journal   (Followers: 10)
Smart Grid     Open Access  
Soft Computing     Hybrid Journal   (Followers: 6)
Software Engineering, IEEE Transactions on     Hybrid Journal   (Followers: 51)
Soil Dynamics and Earthquake Engineering     Hybrid Journal   (Followers: 12)
Soldagem & Inspeção     Open Access  
Solid-State Circuits Magazine, IEEE     Hybrid Journal   (Followers: 9)
SourceOCDE Developpement urbain, rural et regional     Full-text available via subscription   (Followers: 1)
SourceOCDE Energie     Full-text available via subscription  
SourceOECD Energy     Full-text available via subscription  
SourceOECD Science and Technology Statistics - SourceOCDE Base de donnees des sciences et de la technologie     Full-text available via subscription  
SourceOECD Transport     Full-text available via subscription   (Followers: 3)
SourceOECD Urban, Rural and Regional Development     Full-text available via subscription   (Followers: 1)
South African Computer Journal     Full-text available via subscription  
South African Journal of Agricultural Extension     Open Access   (Followers: 4)
South African Journal of Science     Open Access   (Followers: 3)
Sports Engineering     Hybrid Journal   (Followers: 2)
Stahlbau     Hybrid Journal   (Followers: 4)
Steel in Translation     Hybrid Journal  
Steel Research International     Hybrid Journal   (Followers: 27)
Stochastic Analysis and Applications     Hybrid Journal   (Followers: 2)
Stochastic Processes and their Applications     Hybrid Journal   (Followers: 5)
Stochastics and Dynamics     Hybrid Journal  
Strain     Hybrid Journal   (Followers: 2)
Strategic Planning for Energy and the Environment     Hybrid Journal   (Followers: 4)
Studies in Engineering and Technology     Open Access  
Studies in Interface Science     Full-text available via subscription   (Followers: 1)
Studies in Logic and Practical Reasoning     Full-text available via subscription  
Studies in Surface Science and Catalysis     Full-text available via subscription   (Followers: 1)
Superconductor Science and Technology     Hybrid Journal   (Followers: 2)
Surface Engineering     Hybrid Journal   (Followers: 3)
Surface Review and Letters     Hybrid Journal   (Followers: 1)
Surface Science Reports     Full-text available via subscription   (Followers: 15)
Survey Review     Hybrid Journal   (Followers: 6)
Surveying and Land Information Science     Full-text available via subscription   (Followers: 2)
Sustainability Science     Hybrid Journal   (Followers: 7)
Sustainability Science and Engineering     Full-text available via subscription   (Followers: 4)
Sustainable Management of Sediment Resources     Full-text available via subscription  
Swiss Journal of Geosciences     Hybrid Journal  
Symmetry     Open Access  
Synthesis Lectures on Algorithms and Software in Engineering     Full-text available via subscription  
Synthesis Lectures on Antennas     Full-text available via subscription   (Followers: 4)
Synthesis Lectures on Biomedical Engineering     Full-text available via subscription  
Synthesis Lectures on Computational Electromagnetics     Full-text available via subscription   (Followers: 3)
Synthesis Lectures on Energy and the Environment: Technology, Science, and Society     Full-text available via subscription   (Followers: 2)
Synthesis Lectures on Engineering     Full-text available via subscription  
Synthesis Lectures on Global Engineering     Full-text available via subscription  
Synthesis Lectures on Professionalism and Career Advancement for Scientists and Engineers     Full-text available via subscription  
Synthetic Metals     Hybrid Journal   (Followers: 4)
Systems Engineering     Hybrid Journal   (Followers: 6)
Systems Engineering Procedia     Open Access  
Systems Research Forum     Hybrid Journal  
Systems Science & Control Engineering     Open Access   (Followers: 3)
Techno.Com     Open Access  
Technological Engineering     Open Access  
Technologies     Open Access   (Followers: 1)
TECHNOLOGY     Hybrid Journal  
Technology and Innovation     Full-text available via subscription   (Followers: 3)
Technology in Society     Hybrid Journal   (Followers: 4)
Technometrics     Full-text available via subscription   (Followers: 6)
Tecnologia, Ciencia, Educacion     Open Access   (Followers: 1)
Tecnura     Open Access  
Telecommunications Policy     Hybrid Journal   (Followers: 11)
Terahertz Science and Technology, IEEE Transactions on     Hybrid Journal   (Followers: 2)
Textile Science and Technology     Full-text available via subscription   (Followers: 3)
The Journal of Computational Multiphase Flows     Full-text available via subscription  
The Journal of Supercomputing     Hybrid Journal   (Followers: 1)
The Scientific World Journal     Open Access  
Theoretical and Computational Fluid Dynamics     Hybrid Journal   (Followers: 12)
Theoretical Issues in Ergonomics Science     Hybrid Journal   (Followers: 2)
Thermal Engineering     Hybrid Journal   (Followers: 4)
Tikrit Journal of Engineering Science     Open Access  
tm - Technisches Messen     Hybrid Journal   (Followers: 2)
Topics in Catalysis     Hybrid Journal   (Followers: 1)
Traffic Injury Prevention     Hybrid Journal   (Followers: 48)
TRANSACTIONS of the VŠB - Technical University of Ostrava, Safety Engineering Series     Open Access   (Followers: 1)
Transactions of Tianjin University     Full-text available via subscription  
Transport and Telecommunication Journal     Open Access   (Followers: 4)
Transport World Africa     Full-text available via subscription   (Followers: 3)
Transportation Research Record : Journal of the Transportation Research Board     Full-text available via subscription   (Followers: 33)
Transportmetrica A : Transport Science     Hybrid Journal   (Followers: 5)
Trends in Applied Sciences Research     Open Access   (Followers: 1)
Tribology in Industry     Open Access   (Followers: 1)
Tribology International     Hybrid Journal   (Followers: 41)
Tribology Letters     Hybrid Journal   (Followers: 5)
Tribology Transactions     Hybrid Journal   (Followers: 33)
Tribotest     Hybrid Journal  
Tropical Science     Hybrid Journal   (Followers: 1)
Turkish Journal of Engineering and Environmental Sciences     Open Access   (Followers: 1)
Ultramicroscopy     Hybrid Journal   (Followers: 2)
Uludağ University Journal of The Faculty of Engineering     Open Access  
Universal Journal of Applied Science     Open Access   (Followers: 2)
Universal Journal of Engineering Science     Open Access   (Followers: 1)
Utilities Policy     Hybrid Journal   (Followers: 2)
Vacuum     Hybrid Journal   (Followers: 12)
Virtual and Physical Prototyping     Hybrid Journal   (Followers: 3)
Visualization in Engineering     Open Access  
Walailak Journal of Science and Technology     Open Access  
Waste and Biomass Valorization     Hybrid Journal   (Followers: 1)
Waste Management Series     Full-text available via subscription   (Followers: 2)
Waves in Random and Complex Media     Hybrid Journal  
Waves, Wavelets and Fractals     Open Access  
Wear     Hybrid Journal   (Followers: 28)
Welding in the World     Hybrid Journal   (Followers: 2)
West African Journal of Industrial and Academic Research     Open Access   (Followers: 1)
Women in Engineering Magazine, IEEE     Full-text available via subscription   (Followers: 9)
World Journal of Engineering     Full-text available via subscription   (Followers: 3)
World Journal of Engineering and Technology     Open Access  
World Journal of Environmental Engineering     Open Access   (Followers: 2)
World Pumps     Full-text available via subscription   (Followers: 2)
World Science and Technology     Full-text available via subscription   (Followers: 1)
ZDM     Hybrid Journal  
Zede Journal     Open Access  
Zeitschrift fur Energiewirtschaft     Hybrid Journal   (Followers: 1)

  First | 1 2 3 4 5 6 7 | Last

Journal Cover Journal of Global Optimization
  [SJR: 0.919]   [H-I: 51]   [4 followers]  Follow
    
   Hybrid Journal Hybrid journal (It can contain Open Access articles)
   ISSN (Print) 1573-2916 - ISSN (Online) 0925-5001
   Published by Springer-Verlag Homepage  [2334 journals]
  • Parallel global optimization on GPU
    • Authors: Konstantin Barkalov; Victor Gergel
      Pages: 3 - 20
      Abstract: Abstract This work considers a parallel algorithm for solving multidimensional multiextremal optimization problems. This algorithm uses Peano-type space filling curves for dimension reduction. Conditions of non-redundant parallelization of the algorithm are considered. Efficiency of the algorithm on modern computing systems with the use of graphics processing units (GPUs) is investigated. Speedup of the algorithm using GPU as compared with the same algorithm implemented on CPU only is demonstrated experimentally. Computational experiments are carried out on a series of several hundred multidimensional multiextremal problems.
      PubDate: 2016-09-01
      DOI: 10.1007/s10898-016-0411-y
      Issue No: Vol. 66, No. 1 (2016)
       
  • On numerical solving the spherical separability problem
    • Authors: M. Gaudioso; T. V. Gruzdeva; A. S. Strekalovsky
      Pages: 21 - 34
      Abstract: Abstract The separation problem of two sets, whose convex hulls have a nonempty intersection, is considered. In order to find a solution of the problem algorithms of local and global search are developed. The efficiency of the algorithms is demonstrated by computational simulations on test examples.
      PubDate: 2016-09-01
      DOI: 10.1007/s10898-015-0319-y
      Issue No: Vol. 66, No. 1 (2016)
       
  • Adaptive nested optimization scheme for multidimensional global search
    • Authors: Victor Gergel; Vladimir Grishagin; Alexander Gergel
      Pages: 35 - 51
      Abstract: Abstract Methods for solving the multidimensional multiextremal optimization problems using the nested optimization scheme are considered. A novel approach for solving the multidimensional multiextremal problems based on the adaptive nested optimization has been proposed. This approach enables to develop methods of the global optimum search which are more efficient in comparison with the ones on the base of the traditional nested optimization scheme. The new approach provides advantages due to better usage of the information on the problem in the course of optimization. A general scheme of a adaptive nested optimization is described. A theoretical substantiation of the method convergence is given for the case when for solving the univariate subproblems within the nested scheme an information algorithm of global search is used. Results of numerical experiments on the well-known classes of the test multiextremal functions confirming the efficiency of the proposed scheme are presented.
      PubDate: 2016-09-01
      DOI: 10.1007/s10898-015-0355-7
      Issue No: Vol. 66, No. 1 (2016)
       
  • The method of uniform monotonous approximation of the reachable set border
           for a controllable system
    • Authors: Alexandr Yu. Gornov; Tatiana S. Zarodnyuk; Evgeniya A. Finkelstein; Anton S. Anikin
      Pages: 53 - 64
      Abstract: Abstract A numerical method of a two-dimensional non-linear controllable system reachable set boundary approximation is considered. In order to approximate the boundary right piecewise linear closed contours are used: a set of broken lines on a plane. As an application of the proposed technique a method of finding linear functional global extremum is described, including its use for systems with arbitrary dimensionality.
      PubDate: 2016-09-01
      DOI: 10.1007/s10898-015-0346-8
      Issue No: Vol. 66, No. 1 (2016)
       
  • Approximability of the minimum-weight k -size cycle cover problem
    • Authors: Michael Khachay; Katherine Neznakhina
      Pages: 65 - 82
      Abstract: Abstract The cycle cover problem is a combinatorial optimization problem, which is to find a minimum cost cover of a given weighted digraph by a family of vertex-disjoint cycles. We consider a special case of this problem, where, for a fixed number k, all feasible cycle covers are restricted to be of the size k. We call this case the minimum weight k-size cycle cover problem (Min-k-SCCP). Since each cycle in a cover can be treated as a tour of some vehicle visiting an appropriate set of clients, the problem in question is closely related to the vehicle routing problem. Moreover, the studied problem is a natural generalization of the well-known traveling salesman problem (TSP), since the Min-1-SCCP is equivalent to the TSP. We show that, for any fixed \(k>1\) , the Min-k-SCCP is strongly NP-hard in the general setting. The Metric and Euclidean special cases of the problem are intractable as well. Also, we prove that the Metric Min-k-SCCP belongs to APX class and has a 2-approximation polynomial-time algorithm, even if k is not fixed. For the Euclidean Min-2-SCCP in the plane, we present a polynomial-time approximation scheme extending the famous result obtained by S. Arora for the Euclidean TSP. Actually, for any fixed \(c>1\) , the scheme finds a \((1+1/c)\) -approximate solution of the Euclidean Min-2-SCCP in \(O(n^3(\log n)^{O(c)})\) time.
      PubDate: 2016-09-01
      DOI: 10.1007/s10898-015-0391-3
      Issue No: Vol. 66, No. 1 (2016)
       
  • Discrete-continuous optimization of heat network operating conditions in
           parallel operation of similar pumps at pumping stations
    • Authors: N. N. Novitsky; A. V. Lutsenko
      Pages: 83 - 94
      Abstract: Abstract The paper addresses an optimization problem of hydraulic conditions of heat supply systems. The research shows that when the main methods of operation control, including the control of the number of connected pumps at pumping stations, are used this problem is reduced to a mixed discrete-continuous programming problem which involves a nonlinear objective function, nonlinear equality constraints and simple inequalities. The paper presents the basic principles of the methods for calculation of feasible and optimal conditions on the basis of continuous variables as a constituent of the suggested technique for solving the general problem. Consideration is given to four possible strategies to fraction and cut the variants while searching for solutions on the basis of discrete variables. The results of computational experiments illustrating the comparative efficiency of different strategies are presented.
      PubDate: 2016-09-01
      DOI: 10.1007/s10898-016-0403-y
      Issue No: Vol. 66, No. 1 (2016)
       
  • Single-projection procedure for linear optimization
    • Authors: E. A. Nurminski
      Pages: 95 - 110
      Abstract: Abstract It is shown in this paper that under strict complementarity condition, a linear programming problem can be solved by a single orthogonal projection operation onto the cone generated by rows of constraint matrix and corresponding right-hand sides. The efficient projection procedure with the finite termination is provided and computational experiments are reported.
      PubDate: 2016-09-01
      DOI: 10.1007/s10898-015-0337-9
      Issue No: Vol. 66, No. 1 (2016)
       
  • Maximum consistency method for data fitting under interval uncertainty
    • Authors: Sergey P. Shary
      Pages: 111 - 126
      Abstract: Abstract The work is devoted to application of global optimization in data fitting problem under interval uncertainty. Parameters of the linear function that best fits intervally defined data are taken as the maximum point for a special (“recognizing”) functional which is shown to characterize consistency between the data and parameters. The new data fitting technique is therefore called “maximum consistency method”. We investigate properties of the recognizing functional and present interpretation of the parameter estimates produced by the maximum consistency method.
      PubDate: 2016-09-01
      DOI: 10.1007/s10898-015-0340-1
      Issue No: Vol. 66, No. 1 (2016)
       
  • An implementation of exact knapsack separation
    • Authors: Igor Vasilyev; Maurizio Boccia; Saïd Hanafi
      Pages: 127 - 150
      Abstract: Abstract Cutting planes have been used with great success for solving mixed integer programs. In recent decades, many contributions have led to successive improvements in branch-and-cut methods which incorporate cutting planes in branch and bound algorithm. Using advances that have taken place over the years on 0–1 knapsack problem, we investigate an efficient approach for 0–1 programs with knapsack constraints as local structure. Our approach is based on an efficient implementation of knapsack separation problem which consists of the four phases: preprocessing, row generation, controlling numerical errors and sequential lifting. This approach can be used independently to improve formulations with cutting planes generated or incorporated in branch and cut to solve a problem. We show that this approach allows us to efficiently solve large-scale instances of generalized assignment problem, multilevel generalized assignment problem, capacitated \(p\) -median problem and capacitated network location problem to optimality.
      PubDate: 2016-09-01
      DOI: 10.1007/s10898-015-0294-3
      Issue No: Vol. 66, No. 1 (2016)
       
  • Non polyhedral convex envelopes for 1-convex functions
    • Authors: Marco Locatelli
      Pages: 637 - 655
      Abstract: Abstract In this paper we discuss how to derive the non polyhedral convex envelopes for some functions, called 1-convex throughout the paper, over boxes. The main result is about n-dimensional 1-convex functions, but we get to it by first discussing in detail some special cases, namely functions \(xyz^\delta \) , \(\delta >1\) , and, next, more general trivariate functions. The relation between the class of functions investigated in this paper and other classes investigated in the existing literature is discussed.
      PubDate: 2016-08-01
      DOI: 10.1007/s10898-016-0409-5
      Issue No: Vol. 65, No. 4 (2016)
       
  • Projection algorithms for nonconvex minimization with application to
           sparse principal component analysis
    • Authors: William W. Hager; Dzung T. Phan; Jiajie Zhu
      Pages: 657 - 676
      Abstract: Abstract We consider concave minimization problems over nonconvex sets. Optimization problems with this structure arise in sparse principal component analysis. We analyze both a gradient projection algorithm and an approximate Newton algorithm where the Hessian approximation is a multiple of the identity. Convergence results are established. In numerical experiments arising in sparse principal component analysis, it is seen that the performance of the gradient projection algorithm is very similar to that of the truncated power method and the generalized power method. In some cases, the approximate Newton algorithm with a Barzilai–Borwein Hessian approximation and a nonmonotone line search can be substantially faster than the other algorithms, and can converge to a better solution.
      PubDate: 2016-08-01
      DOI: 10.1007/s10898-016-0402-z
      Issue No: Vol. 65, No. 4 (2016)
       
  • A stabilized filter SQP algorithm for nonlinear programming
    • Authors: Chungen Shen; Lei-Hong Zhang; Wei Liu
      Pages: 677 - 708
      Abstract: Abstract This paper presents a stabilized filter sequential quadratic programming (SQP) method for the general nonlinear optimization problems. The technique of stabilizing the inner quadratic programmings is an efficient strategy for the degenerate problem and brings the local superlinear convergence, while the integrated filter technique works effectively and guarantees the global convergence. The new algorithm works on both the primal and dual variables and solves the problem within the computational complexity comparable to the classical SQP algorithm. For the convergence, we show that (1) it converges either to a Karush–Kuhn–Tucker point at which the cone-continuity property holds, or to a stationary point in the sense of minimizing the constraint violation, and (2) under some second-order sufficient conditions, it converges locally superlinearly without any constraint qualifications. Our preliminary numerical results on a set of CUTEr test problems as well as on degenerate problems demonstrate the efficiency of the new algorithm.
      PubDate: 2016-08-01
      DOI: 10.1007/s10898-015-0400-6
      Issue No: Vol. 65, No. 4 (2016)
       
  • Packing ellipsoids by nonlinear optimization
    • Authors: E. G. Birgin; R. D. Lobato; J. M. Martínez
      Pages: 709 - 743
      Abstract: Abstract In this paper, continuous and differentiable nonlinear programming models and algorithms for packing ellipsoids in the n-dimensional space are introduced. Two different models for the non-overlapping and models for the inclusion of ellipsoids within half-spaces and ellipsoids are presented. By applying a simple multi-start strategy combined with a clever choice of starting guesses and a nonlinear programming local solver, illustrative numerical experiments are presented.
      PubDate: 2016-08-01
      DOI: 10.1007/s10898-015-0395-z
      Issue No: Vol. 65, No. 4 (2016)
       
  • Algorithms for the two-stage production-capacitated lot-sizing problem
    • Authors: Hark-Chin Hwang; Hyun-Soo Ahn; Philip Kaminsky
      Pages: 777 - 799
      Abstract: Abstract We model the two-stage production-capacitated lot-sizing problem as a concave minimum cost network flow problem and characterize the possible patterns of flow between successive periods in which transportation occurs. We demonstrate that production and transportation decisions can be made based only on the local state of transportation patterns between successive transportation periods. Utilizing this observation together with the insight that it is not necessary to consider transportation decisions between transportation periods, we provide a novel improved \(O(T^6)\) algorithm (where T is the length of the planning horizon). We extend this approach to special cases, and develop an \(O(T^5)\) algorithm for the case with non-speculative costs, and an \(O(T^4)\) algorithm for the case with linear costs.
      PubDate: 2016-08-01
      DOI: 10.1007/s10898-015-0392-2
      Issue No: Vol. 65, No. 4 (2016)
       
  • Algorithms for the partial inverse matroid problem in which weights can
           only be increased
    • Authors: Zhao Zhang; Shuangshuang Li; Hong-Jian Lai; Ding-Zhu Du
      Pages: 801 - 811
      Abstract: Abstract In a partial inverse combinatorial problem, given a partial solution, the goal is to modify data as small as possible such that there exists an optimal solution containing the given partial solution. In this paper, we study a constraint version of the partial inverse matroid problem in which the weight can only be increased. Two polynomial time algorithms are presented for this problem.
      PubDate: 2016-08-01
      DOI: 10.1007/s10898-016-0412-x
      Issue No: Vol. 65, No. 4 (2016)
       
  • A biased random-key genetic algorithm to maximize the number of accepted
           lightpaths in WDM optical networks
    • Authors: Julliany S. Brandão; Thiago F. Noronha; Celso C. Ribeiro
      Pages: 813 - 835
      Abstract: Abstract Given a set of lightpath requests, the problem of routing and wavelength (RWA) assignment in wavelength division multiplexing (WDM) optical networks consists in routing a subset of these requests and assigning a wavelength to each of them, such that two lightpaths that share a common link are assigned to different wavelengths. There are many variants of this problem in the literature. We focus in the variant in which the objective is to maximize the number of requests that may be accepted, given a limited set of available wavelengths. This problem is called max-RWA and it is of practical and theoretical interest, because algorithms for this variant can be extended for other RWA problems that arise from the design of WDM optical networks. A number of exact algorithms based on integer programming formulations have been proposed in the literature to solve max-RWA, as well as algorithms to provide upper bounds to the optimal solution value. However, the algorithms based on the state-of-the-art formulations in the literature cannot solve the largest instances to optimality. For these instances, only upper bounds to the value of the optimal solutions are known. The literature on heuristics for max-RWA is short and focus mainly on solving small size instances with up to 27 nodes. In this paper, we propose new greedy constructive heuristics and a biased random-key genetic algorithm, based on the best of the proposed greedy heuristics. Computational experiments showed that the new heuristic outperforms the best ones in literature. Furthermore, for the largest instances in the literature where only upper bounds to the value of the optimal solutions are known, the average optimality gap of the best of the proposed heuristics is smaller than 4 %.
      PubDate: 2016-08-01
      DOI: 10.1007/s10898-015-0389-x
      Issue No: Vol. 65, No. 4 (2016)
       
  • Interval Branch-and-Bound algorithms for optimization and constraint
           satisfaction: a survey and prospects
    • Authors: Ignacio Araya; Victor Reyes
      Pages: 837 - 866
      Abstract: Abstract Interval Branch and Bound algorithms are used to solve rigorously continuous constraint satisfaction and constrained global optimization problems. In this paper, we explain the basic principles behind interval Branch and Bound algorithms. We detail the main components and describe issues that should be considered to improve the efficiency of the algorithms.
      PubDate: 2016-08-01
      DOI: 10.1007/s10898-015-0390-4
      Issue No: Vol. 65, No. 4 (2016)
       
  • Gap functions for quasi-equilibria
    • Abstract: Abstract An approach for solving quasi-equilibrium problems (QEPs) is proposed relying on gap functions, which allow reformulating QEPs as global optimization problems. The (generalized) smoothness properties of a gap function are analysed and an upper estimate of its Clarke directional derivative is given. Monotonicity assumptions on both the equilibrium and constraining bifunctions are a key tool to guarantee that all the stationary points of a gap function actually solve QEP. A few classes of constraints satisfying such assumptions are identified covering a wide range of situations. Relying on these results, a descent method for solving QEP is devised and its convergence proved. Finally, error bounds are given in order to guarantee the boundedness of the sequence generated by the algorithm.
      PubDate: 2016-08-23
      DOI: 10.1007/s10898-016-0458-9
       
  • Improving the convergence rate of the DIRECT global optimization algorithm
    • Authors: Qunfeng Liu; Guang Yang; Zhongzhi Zhang; Jinping Zeng
      Abstract: Abstract DIRECT is derivative-free global-search algorithm has been found to perform robustly across a wide variety of low-dimensional test problems. The reason DIRECT’s robustness is its lack of algorithmic parameters that need be “tuned” to make the algorithm perform well. In particular, there is no parameter that determines the relative emphasis on global versus local search. Unfortunately, the same algorithmic features that enable DIRECT to perform so robustly have a negative side effect. In particular, DIRECT is usually quick to get close to the global minimum, but very slow to refine the solution to high accuracy. This is what we call DIRECT’s “eventually inefficient behavior.” In this paper, we outline two root causes for this undesirable behavior and propose modifications to eliminate it. The paper builds upon our previously published “MrDIRECT” algorithm, which we can now show only addressed the first root cause of the “eventually inefficient behavior.” The key contribution of the current paper is a further enhancement that allows MrDIRECT to address the second root cause as well. To demonstrate the effectiveness of the enhanced MrDIRECT, we have identified a set of test functions that highlight different situations in which DIRECT has convergence issues. Extensive numerical work with this test suite demonstrates that the enhanced version of MrDIRECT does indeed improve the convergence rate of DIRECT.
      PubDate: 2016-08-12
      DOI: 10.1007/s10898-016-0447-z
       
  • Special Issue: XVI Baikal International
           School-Seminar <<Optimization Methods and Their
           Applications>>
    • Authors: Oleg Khamisov; Yury Kochetov; Alexander Strekalovsky
      PubDate: 2016-08-08
      DOI: 10.1007/s10898-016-0457-x
       
 
 
JournalTOCs
School of Mathematical and Computer Sciences
Heriot-Watt University
Edinburgh, EH14 4AS, UK
Email: journaltocs@hw.ac.uk
Tel: +00 44 (0)131 4513762
Fax: +00 44 (0)131 4513327
 
Home (Search)
Subjects A-Z
Publishers A-Z
Customise
APIs
Your IP address: 54.80.154.132
 
About JournalTOCs
API
Help
News (blog, publications)
JournalTOCs on Twitter   JournalTOCs on Facebook

JournalTOCs © 2009-2016