Filters








319,721 Hits in 6.2 sec

Improving Iterated Local Search Solution for the Linear Ordering Problem with Cumulative Costs (LOPCC) [chapter]

David Terán Villanueva, Héctor Joaquín Fraire Huacuja, Abraham Duarte, Rodolfo Pazos R., Juan Martín Carpio Valadez, Héctor José Puga Soberanes
2010 Lecture Notes in Computer Science  
In this paper the linear ordering problem with cumulative costs is approached. The best known algorithm solution for the problem is the tabu search proposed by Duarte.  ...  Then to evaluate the diversification potential of the heuristic construction, two iterated local search algorithms were developed.  ...  In [4] a tabu search metaheuristic algorithm for the linear ordering problem is proposed.  ... 
doi:10.1007/978-3-642-15390-7_19 fatcat:pb66x7pmbbes3apawgngu6dcam

Local search algorithms for the min-max loop layout problem

J A Bennell, C N Potts, J D Whitehead
2002 Journal of the Operational Research Society  
Congram'” points out the advan- tage of using dynamic programming to search a neighbourhood of exponential size for the linear ordering problem.  ...  Intensification and diversification with elite tabu search solutions for the linear ordering problem. Comput Opns Res 26: 1217-1230. Baum EB (1986).  ... 
doi:10.1057/palgrave.jors.2601269 fatcat:aij2x6ye6vfppd4k75bos2sp7i

Just-In-Time Software Pipelining

Hongbo Rong, Hyunchul Park, Youfeng Wu, Cheng Wang
2014 Proceedings of Annual IEEE/ACM International Symposium on Code Generation and Optimization - CGO '14  
Also an iterative sub-algorithm • Linearize it with a constant B • Specific order in visiting edges -Scan nodes in sequential order, and visit their incoming edges • Values are propagated along local edges  ...  O(exponential*E) • Recurrence Minimum II • Also an iterative sub-algorithm • Linearize it with a constant B • Specific order in visiting edges II/MII (The lower, the better)OptimalPreliminary  ... 
doi:10.1145/2581122.2544148 fatcat:xilt4wqecfgbve4oalh7xig4by

A three-scale domain decomposition method for the 3D analysis of debonding in laminates

Pierre Kerfriden, O. Allix, P. Gosselet
2009 Computational Mechanics  
In this paper, the exact mesoscale solution is sought using parallel iterative solvers.  ...  Even when modeled at the mesoscale, the computation of these structures results in very large numerical problems.  ...  In order for the two problems to be well-posed, search directions E + and E − linking the solutions s and s through the iterative process are introduced (see Figure (6) ).  ... 
doi:10.1007/s00466-009-0378-3 fatcat:mnp5uxcznnh6jkhlavp437repi

Bounds-Consistent Local Search [chapter]

Stefania Verachi, Steven Prestwich
2005 Lecture Notes in Computer Science  
It describes a hybrid algorithm for integer linear programming which combines local search and bounds propagation, inspired by the success of a randomized algorithm for Boolean Satisfiability (SAT) called  ...  This paper describes a hybrid approach to solving large-scale constraint satisfaction and optimization problems.  ...  In order to avoid this, a new random value for each variable is generated after N iterations if no one flip occurs during a search. N is tuned depending on the specific problem.  ... 
doi:10.1007/11564751_108 fatcat:xix5wbikwva2xif3fegwxwgth4

New ALS Methods With Extrapolating Search Directions and Optimal Step Size for Complex-Valued Tensor Decompositions

Yannan Chen, Deren Han, Liqun Qi
2011 IEEE Transactions on Signal Processing  
Owing to the nonlinearity of the problem, the often used linear search direction is not always powerful enough. In this paper, we propose two higher-order search directions.  ...  The second one, algebraic search direction, is constructed via a quadratic approximation of three successive iterates.  ...  ACKNOWLEDGMENT The authors thank the reviewers for their comments and suggestions, which help us improve the presentation of the paper essentially.  ... 
doi:10.1109/tsp.2011.2164911 fatcat:arsjxghxkvba7nzb7m6qxhiz6y

Restarting iterative projection methods for Hermitian nonlinear eigenvalue problems with minmax property

Marta M. Betcke, Heinrich Voss
2016 Numerische Mathematik  
The variational property allows for the eigenvalues of such problems to be computed safely one after another and avoiding repetitions, as it is the case for linear Hermitian eigenvalue problems.  ...  This local numbering only requires a presence of one eigenvector in the search subspace, effectively eliminating the search subspace growth and therewith the super-linear increase of the computational  ...  For polynomial eigenvalue problems a method at hand is linearization, where the enumeration of eigenvalues in the sense of Section 3 can be deduced from the natural ordering of the eigenvalues of the linearized  ... 
doi:10.1007/s00211-016-0804-3 pmid:28615742 pmcid:PMC5445551 fatcat:y5dsgpxq3jgsndk6fm5pvwzdwm

Mixed Integer Program Heuristic for Linear Ordering Problem

Ehsan Iranmanesh, Ramesh Krishnamurti
2016 Proceedings of 5th the International Conference on Operations Research and Enterprise Systems  
Our heuristic generates a starting feasible solution based on the Linear Programming solution to the IP formulation for the Linear Ordering Problem.  ...  The Linear Ordering Problem is a classic optimization problem which can be used to model problems in graph theory, machine scheduling, and voting theory, many of which have practical applications.  ...  Local search is used to find the optimal value for k. PROBLEM FORMULATIONS The linear ordering problem may be formulated as an integer linear program.  ... 
doi:10.5220/0005710701520156 dblp:conf/icores/IranmaneshK16 fatcat:hcxbvvqdobgh7meiwtgtexx5iu

Linear search optimization through the Armijo rule method

German Correa Velez, Fernando Mesa, Pedro Pablo Cardenas Alzate
2018 Contemporary Engineerng Sciences  
on their optimization problem, whether it is linear optimization with restrictions, non-linear optimization unlimited among others.  ...  The intermediate sections show the optimization methods based on direct search and search with descent directions in such a way that the reader has enough information to choose one method or another depending  ...  We would like to thank the referee for his valuable suggestions that improved the presentation of this paper and our gratitude to the Department of Mathematics of the Universidad Tecnológica de Pereira  ... 
doi:10.12988/ces.2018.8121 fatcat:h6dmdoipqrhclkpy4xuhv6l454

A Multi-scale Algorithm for the Linear Arrangement Problem [chapter]

Yehuda Koren, David Harel
2002 Lecture Notes in Computer Science  
The algorithm is based on the fact that the minimum linear arrangement problem possesses a "locality property", to the effect that the best ordering of a set of vertices S that placed to the right of the  ...  Finding a linear ordering of the vertices of a graph is a common problem arising in diverse applications.  ...  Acknowledgement We would like to thank Chris Walshaw for his useful comments and corrections.  ... 
doi:10.1007/3-540-36379-3_26 fatcat:73gju6kdvbbcxi33h6cw3ycc3e

A NEW ALGORITHM FOR THE TRIANGULATION OF INPUT–OUTPUT TABLES IN ECONOMICS [chapter]

B. H. Chiarini, W. Chaovalitwongse, P. M. Pardalos
2004 Series on Computers and Operations Research  
Because of the complexity of the triangulation procedure, it is essential in practice to search for quick approximate (heuristic) algorithms for the linear ordering problem.  ...  Finally, the linear ordering problem can be formulated as a quadratic assignment problem (QAP).  ... 
doi:10.1142/9789812562586_0015 fatcat:d43vnkjyuzej7cafgrnb5ophzu

Great deluge with non-linear decay rate for solving course timetabling problems

Dario Landa-Silva, Joe Henry Obit
2008 2008 4th International IEEE Conference Intelligent Systems  
In the original great deluge, the water level decreases steadily in a linear fashion.  ...  Course timetabling is the process of allocating, subject to constraints, limited rooms and timeslots for a set of courses to take place.  ...  The methods compared were: evolutionary algorithm, ant colony optimisation, iterated local search, simulated annealing and tabu search.  ... 
doi:10.1109/is.2008.4670447 fatcat:7skfnekfmra73crc7gi5pc7g7y

PPD-IPM: Outer primal, inner primal-dual interior-point method for nonlinear programming [article]

Martin Neuenhofen
2018 arXiv   pre-print
In this paper we present a novel numerical method for computing local minimizers of twice smooth differentiable non-linear programming (NLP) problems.  ...  We provide: a mathematical description of the method; proof of global convergence; proof of second order local convergence; an implementation in Matlab; experimental results for large sparse NLPs from  ...  This is because for each of the problems the method achieves local second order convergence. Thus, choosing smaller values for tol would only have negligible impact on the iteration count.  ... 
arXiv:1803.01829v1 fatcat:khw2ryagzjh53ih3e2allo5s6e

TUNING OF THE METAHEURISTIC VARIABLE NEIGHBORHOOD SEARCH FOR A FOREST PLANNING PROBLEM

Carlos Alberto Araújo Júnior, João Batista Mendes, Adriana Leandra de Assis, Christian Dias Cabacinha, Jonathan James Stocks, Liniker Fernandes da Silva, Helio Garcia Leite
2018 Cerne  
VARIABLE NEIGHBORHOOD SEARCH FOR A FOREST PLANNING PROBLEM 260 CERNE ARAÚJO JÚNIOR et al.  ...  Tuning of the metaheuristic variable neighborhood search for a forest planning problem. CERNE, v. 24, n. 3, p. 259-268, 2018. HIGHLIGHTS VNS is effi cient to solve a forest planning problem.  ...  by granting a productivity grant to one of the authors.  ... 
doi:10.1590/01047760201824032538 fatcat:rpch3yxsefb77fxusctrdhsecu

A Manifold Learning Approach to Data-Driven Computational Elasticity and Inelasticity

Rubén Ibañez, Emmanuelle Abisset-Chavanne, Jose Vicente Aguado, David Gonzalez, Elias Cueto, Francisco Chinesta
2016 Archives of Computational Methods in Engineering  
In this work we propose a new method, able to directly link data to computers in order to perform numerical simulations.  ...  Even if one can be confident on the first type of equations, the second one contains modeling errors.  ...  and Competitiveness through Grants Number CICYT DPI2014-51844-C2-1-R and DPI2015-72365-EXP and by the Regional Government of Aragon and the European Social Fund, Research Group T88.  ... 
doi:10.1007/s11831-016-9197-9 fatcat:ie6wcumjmneuxp6lzbrvl66l34
« Previous Showing results 1 — 15 out of 319,721 results