Solving Large-Scale Hybrid Circuit-Antenna Problems
نویسندگان
چکیده
منابع مشابه
A Hybrid Method for Solving Large-Scale Supply Chain Problems
The strategic supply chain design problem which allows capacity shifts and budget limitations can be formulated as a linear program. Since facilities are allowed to be opened or shut down during the planning horizon, this problem is in fact a mixed integer problem. Choosing the optimal set of facilities to serve the customer demands is an NPhard combinatorial optimization problem. We present a ...
متن کاملA Hybrid Approach for Solving Large Scale Crew Scheduling Problems
We consider several strategies for computing optimal solutions to large scale crew scheduling problems. Provably optimal solutions for very large real instances of such problems were computed using a hybrid approach that integrates mathematical and constraint programming techniques. The declarative nature of the latter proved instrumental when modeling complex problem restrictions and, particul...
متن کاملSolving Large Scale Phylogenetic Problems using DCM2
In an earlier paper, we described a new method for phylogenetic tree reconstruction called the Disk Covering Method, or DCM. This is a general method which can be used with any existing phylogenetic method in order to improve its performance. We showed analytically and experimentally that when DCM is used in conjunction with polynomial time distance-based methods, it improves the accuracy of th...
متن کاملSolving Large Scale Crew Pairing Problems
Crew pairing is one of the most critical processes in airline management operations. Taking a timetable as input, the objective of this process is to find an optimal way to partition flights of the timetable without breaking rules and regulations which are enforced by an airline. The problem has attracted many scientists in recent decades. The main challenge is that there is no general method t...
متن کاملHybrid Simulated Annealing and Nelder-mead Algorithm for Solving Large-scale Global Optimization Problems
This paper presents a new algorithm for solving large scale global optimization problems based on hybridization of simulated annealing and Nelder-Mead algorithm. The new algorithm is called simulated Nelder-Mead algorithm with random variables updating (SNMRVU). SNMRVU starts with an initial solution, which is generated randomly and then the solution is divided into partitions. The neighborhood...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Circuits and Systems I: Regular Papers
سال: 2011
ISSN: 1549-8328,1558-0806
DOI: 10.1109/tcsi.2010.2072010