A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Filters
Actuator allocation for integrated control in tokamaks: architectural design and a mixed-integer programming algorithm
2017
Fusion engineering and design
Preserved Fulltext
Additionally, we present an efficient actuator allocation algorithm for Heating and Current Drive (H&CD) actuators. ...
The actuator allocation problem is formulated as a Mixed-Integer Quadratic Programming optimization problem, allowing to quickly search for the best allocation option without the need to compute all allocation ...
Secondly we provide a generic actuator allocation algorithm for the H&CD systems using a Mixed-Integer Quadratic Programming (MIQP) optimization problem formulation, allowing to quickly search for the ...
doi:10.1016/j.fusengdes.2017.09.004
fatcat:qx2nwxkkijbhphnenvgii5aje4
A recursive algorithm for bandwidth partitioning
2010
IEEE Transactions on Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
When class bandwidth is an integer multiple of the next lower class and total bandwidth is an integer multiple of the largest class bandwidth, we develop a recursive algorithm that determines the optimal ...
complete partitioning policy with a significantly lower complexity than that of known dynamic programming or mixed integer programming approaches. ...
A RECURSIVE ALGORITHM A dynamic programming approach to the determination of the optimal solution was provided in [13] , and a mixed integer programming approach was provided in [14] . ...
doi:10.1109/tcomm.2010.04.090041
fatcat:qiyjd32h6fag7npngkkxtwvq2q
Page 1331 of Mathematical Reviews Vol. , Issue 86c
[page]
1986
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Author summary: “An algorithm is presented for solving mixed- integer linear programs with a staircase structure. ...
(J-KYOT) An algorithm for the equipollent resource allocation problem. Math. Oper. Res. 10 (1985), no. 1, 44-53. ...
How to Integrate Financial Big Data and FinTech in a Real Application in Banks: A Case of the Modeling of Asset Allocation for Products Based on Data
2020
Information
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
An asset allocation optimization model for key clients and financial products is developed and deployed on a business platform by compiling a program to a module using MATLAB to show how to integrate financial ...
Then, we select non-integer linear programming as the model solver by testing two algorithm solvers with six real test cases separately, according to the solving time. ...
We also tested the non-integer programming algorithm for a comparison and to determine if we could obtain a more accurate algorithm.
Integer Programming Then, we considered how to solve this model. ...
doi:10.3390/info11100460
fatcat:xa2qb6cbcze75b3kp4eown3aqm
A two-phase linear programming approach for redundancy allocation problems
2002
Yugoslav Journal of Operations Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The first phase is used to approximately allocate the resource by using a general linear programming, while the second phase is used to re-allocate the slacks of resource by using a 0-1 integer linear ...
This paper proposes a new two-phase linear programming approach for solving the nonlinear redundancy allocation problems subject to multiple linear constraints. ...
The author would like to thank an anonymous reviewer for his/her helpful comments and suggestions that greatly improved the presentation of this paper. ...
doi:10.2298/yjor0202227h
fatcat:xm5ho6dejvhala3a327hw7dz54
Evaluation of Algorithms for Local Register Allocation
[chapter]
1999
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2009; you can also visit the original URL.
The file type is application/pdf.
The paper discusses the first optimum algorithm based on integer linear programming as one of the LRA algorithms. ...
Experiments were performed for different values of N and C. The results show that only for large basic blocks the allocation quality gap between the different algorithms is significant. ...
We thank Keith Cooper, Tim Harvey, and Taylor Simpson from the Massively Scalar Compiler Group at Rice University for providing us with the ILOC software and benchmark codes. ...
doi:10.1007/978-3-540-49051-7_10
fatcat:oiokdskbyfgmxadjudkt76rsgm
Invigilator Duty Allocation in Examination Hall
2020
VOLUME-8 ISSUE-10, AUGUST 2019, REGULAR ISSUE
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
This algorithm has written and implemented in java language. ...
This paper proposed an optimize algorithm to allocate duties to invigilators. ...
Step 4: Declare method sort_priority which return type is void, parameters will be an array list of Obj type and two integer variables start and end for starting of priority and for changing priority after ...
doi:10.35940/ijitee.e3028.049620
fatcat:55yzsbhx55hwddgb4o66jcogya
Page 134 of The Journal of the Operational Research Society Vol. 60, Issue 1
[page]
2009
The Journal of the Operational Research Society
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
a linear programming (LP) problem, and will still expect to obtain integer solutions, which are hence optimal for the integer program as well. ...
We encode it as an (binary)integer programming problem (see Nemhauser and Wolsey (1988), or see Bosch and Trick (2005) for a recent brief introduc- tion to mathematical programming), but then relax to ...
Efficient Resource Allocation through Integer Linear Programming: a detailed example
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In this paper, we show how a resource allocation problem can be solved through Integer Linear Programming (ILP). ...
Next, the specific benefits of the ILP approach compared to other resource allocation algorithms are outlined in this paper. ...
Specific benefits of ILP compared to other resource allocation algorithms When an optimization problem can be formulated as an Integer Linear Program, the optimal solution can be calculated by means of ...
arXiv:2009.13178v1
fatcat:ijfiuuvdwrc5xny6vw4eiwnep4
A nonlinear Knapsack problem
1995
Operations Research Letters
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf.
terms); and for the continuous case an algorithm delivering an e-accurate solution in O(nlog(B/~)) operations. ...
We consider this problem in integer and continuous variables, and also when the packing constraint is convex. ...
An O(NP*) algorithm for solving the 0/1 Knapsack problem The following dynamic programming algorithm solves the problem optimally for integer objective function coefficients: Let Fi(i) denote
A fully ...
doi:10.1016/0167-6377(95)00009-9
fatcat:manyz6722fcargveubqupqajey
Page 453 of Communications of the Association for Computing Machinery Vol. 4, Issue 10
[page]
1961
Communications of the Association for Computing Machinery
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
.
——, Outline of an algorithm for integer solutions to linear pro- grams. Bull. Amer. Math. Soc. 64 (1958) 275-278.
—, All-integer integer programming algorithm. ...
Note on solving linear programs in integers. Naval Res. Log. Quart. 6 (1959) 75-76.
Gomory, R. E. An algorithm for integer solutions to linear pro- grams. ...
Page 667 of Mathematical Reviews Vol. 57, Issue 2
[page]
1979
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
The author describes a combination of Gomory’s first algorithm and Gomory’s all-integer algorithm for solving pure integer programs. ...
The author presents an algorithm for solving linear integer programming problems. ...
Flex Net Sim: A Lightly Manual
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
The final product is a library capable of being included in any program written in C ++, allowing the design of resource allocation algorithms through macros used in the same source file of the user that ...
For this reason, this project aims to create a tool that allows focusing on the creation of algorithms, generating a common platform for simulation. ...
The library aims to facilitate the implementation and testing of new resource allocation algorithms in programs written in C ++. ...
arXiv:2105.02762v1
fatcat:s5eizipnszfzvmcojnhn2o37ga
An Efficient Real-Time Method for Improving Intrinsic Delay of Capacity Allocation in Interactive GEO Satellite Networks
2004
IEEE Transactions on Vehicular Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
His research interests include stochastic modeling, performance analysis, scheduling algorithms, and optimization techniques for radio resource management in broad-band wireless and/or satellite networks ...
At ETRI, he has been involved with development of interactive broad-band satellite access systems, where he develops various real-time algorithms for radio resource management and control. ...
ACKNOWLEDGMENT The author is grateful to the anonymous reviewers for their valuable comments. ...
doi:10.1109/tvt.2004.823478
fatcat:lr37ypyfrzgzrjfzzos34mfavi
Page 5355 of Mathematical Reviews Vol. , Issue 2002G
[page]
2002
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Evanston, IL)
Experimental results on using general disjunctions in branch- and-bound for general-integer linear programs. ...
linear programming problem with multi-criteria and multi-constraint levels: a branch-and-partition algorithm. ...
« Previous
Showing results 1 — 15 out of 95,873 results