| Year |
Citation |
Score |
| 2012 |
Lai MC, Sohn HS, Tseng TL, Bricker DL. A hybrid Benders/genetic algorithm for vehicle routing and scheduling problem International Journal of Industrial Engineering : Theory Applications and Practice. 19: 33-46. |
0.356 |
|
| 2008 |
Sohn H, Lee JD, Bricker DL, Hoffman JD. A dynamic programming algorithm for scheduling in-vehicle messages Ieee Transactions On Intelligent Transportation Systems. 9: 226-234. DOI: 10.1109/Tits.2008.922876 |
0.507 |
|
| 2004 |
Vargas S, Bills D, Bricker D. An educational production system complexity: Implications for model completeness and performance improvement Complexity International. 10: 1-27. |
0.543 |
|
| 2002 |
Rajgopal J, Bricker DL. Solving posynomial geometric programming problems via generalized linear programming Computational Optimization and Applications. 21: 95-109. DOI: 10.1023/A:1013500514075 |
0.675 |
|
| 2000 |
Kawatra R, Bricker D. Multiperiod planning model for the capacitated minimal spanning tree problem European Journal of Operational Research. 121: 412-419. DOI: 10.1016/S0377-2217(99)00036-3 |
0.323 |
|
| 1999 |
Sankaran JK, Bricker DL, Juang SH. Strong fractional cutting-plane algorithm for resource-constrained project scheduling International Journal of Industrial Engineering : Theory Applications and Practice. 6: 99-111. |
0.366 |
|
| 1998 |
Hsieh YC, Chen TC, Bricker DL. Genetic algorithms for reliability design problems Microelectronics Reliability. 38: 1599-1605. |
0.351 |
|
| 1998 |
Xu L, Bricker DL, Kortanek KO. Bounds for stop-loss premium under restrictions on I-divergence Insurance: Mathematics and Economics. 23: 119-139. |
0.351 |
|
| 1997 |
Yang HH, Bricker DL. Investigation of path-following algorithms for signomial geometric programming problems European Journal of Operational Research. 103: 230-241. |
0.484 |
|
| 1997 |
Bricker DL, Kortanek KO, Xu L. Maximum likelihood estimates with order restrictions on probabilities and odds ratios: A geometric programming approach Journal of Applied Mathematics and Decision Sciences. 1: 53-65. |
0.448 |
|
| 1996 |
Lin EYH, Bricker DL. Computational comparison on the partitioning strategies in multiple choice integer programming European Journal of Operational Research. 88: 182-202. DOI: 10.1016/0377-2217(94)00161-8 |
0.368 |
|
| 1996 |
Choi JC, Bricker DL. A heuristic procedure for rounding posynomial geometric programming solutions to discrete values Computers and Industrial Engineering. 30: 623-629. DOI: 10.1016/0360-8352(95)00180-8 |
0.324 |
|
| 1996 |
Choi JC, Bricker DL. Effectiveness of a geometric programming algorithm for optimization of machining economics models Computers and Operations Research. 23: 957-961. DOI: 10.1016/0305-0548(96)00008-1 |
0.506 |
|
| 1996 |
Hsieh YC, Bricker DL. New infeasible interior-point algorithm based on monomial method Computers and Operations Research. 23: 653-666. DOI: 10.1016/0305-0548(95)00068-2 |
0.419 |
|
| 1995 |
Bricker DL, Choi JC. Obtaining a feasible geometric programming primal solution, given a near-optimal dual solution Engineering Optimization. 23: 323-331. DOI: 10.1080/03052159508941362 |
0.394 |
|
| 1995 |
Choi JC, Bricker DL. Geometric programming with several discrete variables: Algorithms employing generalized benders’ decomposition Engineering Optimization. 25: 201-212. DOI: 10.1080/03052159508941263 |
0.454 |
|
| 1993 |
Raz T, Bricker D. Sequencing of inspection operations subject to errors European Journal of Operational Research. 68: 251-264. DOI: 10.1016/0377-2217(93)90307-9 |
0.331 |
|
| 1993 |
Bricker DL, Choi JC, Rajgopal J. On geometric programming problems having negative degrees of difficulty European Journal of Operational Research. 68: 427-430. DOI: 10.1016/0377-2217(93)90199-W |
0.641 |
|
| 1992 |
Bricker DL, Lin EYH. Teaching dynamic programming using apl International Journal of Mathematical Education in Science and Technology. 23: 433-443. DOI: 10.1080/0020739920230313 |
0.444 |
|
| 1992 |
Rajgopal J, Bricker DL. On subsidiary problems in geometric programming European Journal of Operational Research. 63: 102-113. DOI: 10.1016/0377-2217(92)90058-H |
0.677 |
|
| 1991 |
Lin EYH, Bricker DL. On the calculation of true and pseudo penalties in multiple choice integer programming European Journal of Operational Research. 55: 228-236. DOI: 10.1016/0377-2217(91)90227-M |
0.307 |
|
| 1991 |
Raz T, Bricker D. Optimal and heuristic solutions to the variable inspection policy problem Computers and Operations Research. 18: 115-123. DOI: 10.1016/0305-0548(91)90047-U |
0.323 |
|
| 1990 |
Rajgopal J, Bricker DL. Posynomial geometric programming as a special case of semi-infinite linear programming Journal of Optimization Theory and Applications. 66: 455-475. DOI: 10.1007/BF00940932 |
0.638 |
|
| 1988 |
Bricker D, Gumerlock S. Application of a three-level evaluation plan for monitoring child progress and program effects The Journal of Special Education. 22: 66-81. DOI: 10.1177/002246698802200109 |
0.31 |
|
| 1983 |
Bricker DL, Rajgopal J. Yet another geometric programming dual algorithm Operations Research Letters. 2: 177-180. DOI: 10.1016/0167-6377(83)90051-2 |
0.629 |
|
| 1980 |
Bricker DL. Bounding a class of nonconvex linearly-constrained resource allocation problems via the surrogate dual Mathematical Programming. 18: 68-83. DOI: 10.1007/BF01588298 |
0.38 |
|
| 1977 |
Bricker DL. Reformulation of special ordered sets for implicit enumeration algorithms, with applications in nonconvex separable programming Aiie Transactions. 9: 195-203. DOI: 10.1080/05695557708975143 |
0.476 |
|
| Show low-probability matches. |