skip to main content
10.5555/338219.338630acmconferencesArticle/Chapter ViewAbstractPublication PagessodaConference Proceedingsconference-collections
Article
Free access

Optimizing the sum of linear fractional functions and applications

Published: 01 February 2000 Publication History
First page of PDF

References

[1]
E. M. Arkin, Y.-J. Chiang, M. Held, J. S. B. Mitchell, V. Sacxistan, S. S. Skiena, and T.-C. Yang, On Minimum-Area Hulls, Algorithmica, 21:119-136, 1998.
[2]
D. A. Bini and G. Fiorentino, Numerical Computation of Polynomial Roots: MPSolve-Version 2.0, in FRISCO Report, 1998.
[3]
T. M. Chan, Deterministic Algorithms for ~-d Convex Programming and 3-d Online Linear Programming, Journal of Algorithms, 27:147-166, 1998.
[4]
B. Chazelle, On the Convex Layers of a Planar Set, IEEE Transactions on Information Theory, 31(4):509- 517, 1985.
[5]
D.Z. Chen, O. Daescu, X. Hu, X. Wu, and J. Xu, Determining an Optimal Penetration among Weighted Regions in Two and Three Dimensions, in Proc. of the 15th Annual ACM Symposium on Computational Geometry, pp. 322-331, 1999.
[6]
D.Z. Chen and J. Xu, Peeling an arrangement topologically, manuscript, 1999.
[7]
L. Craig, J.L. Zhou, and A.L. Tits, User's Guide for CFSQP Version ~.5, Electrical Eng. Dept: and Institute for Systems Research, University of Maryland, TR-94-16rl, 1994.
[8]
K. Daniels, The Restrict/Evaluate/Subdivide Paradigm for Translational Containment, in Proc. Fifth MSI Stony Brook Workshop on Computational Geometry, 1995.
[9]
H. Edelsbrunner, Algorithms in Combinatorial Geometry, Springer-Verlag, New York, 1987.
[10]
D. Eppstein, Dynamic Three-Dimensional Linear Programming, in Proc. 32nd Annual IEEE Symposium on Foundations of Computer Science, pp. 488-494, 1991.
[11]
J. E. Falk and S. W. Palocsay, Optimizing the Sum of Linear Fractional Functions, Collection: Recent Advances in Global Optimization, C.A. Floudas and P. M. Pardalos (eds.), pp. 221-258, 1992.
[12]
S. Hashizume, M. Fukushima, N. Katoh, and T. ibaraki, Approximation Scheme for Combinatorial Fractional Programming Problems, Mathematical Programming, 37:255-267, 1987.
[13]
L. Ingber, Adaptive Simulated Annealing, Optimization Algorithm for Nonlinear and Stochastic Systems, http://www.ingber.com/#ASA-CODE.
[14]
M.Jelasity and J. Dombi, GAS Genetic Algorithm, ftp: / / ftp.j ate. uszeged.hu/pub/math/optimization/GAS/.
[15]
H. Konno, T. Kuno, and Y. Yajima, Global Minimization of a Generalized Convex Multiplicative Function, Journal of Global Optimization, 4:47-62, 1994.
[16]
G. Liotta, F. P. Preparata, and R. Tamassia, Robust Proximity Queries: An Illustration of Degree- Driven Algorithm Design, SIAM Journal on Computing, 28:864-889, 1998.
[17]
J. Majhi, R. Janardan, J. Schwerdt, M. Staid, and P. Gupta, Minimizing Support Structures and Trapped Area in Two-Dimensional Layered Manufacturing, Technical Report TR-97-058, Dept. of Computer Science, University of Minnesota, Dec. 1997.
[18]
J. Majhi, R. Janardan, M. Staid, and P. Gupta, On Some Geometric Optimization Problems in Layered Manufacturing, in Proc. 5th Workshop on Algorithms and Data Structures, pp. 136-149, Springer-Verlag, 1997.
[19]
N. Megiddo, Linear Programming in Linear Time When the Dimension Is Fixed, Journal of ACM, 31:114- 127, 1984.
[20]
Z. Michalewicz, GENOCOP III Genetic Algorithm for Constrained Problems, http://www.coe.uncc.edu/,~zbyszek/gcreadme.html.
[21]
V. Milenkovic, K. Daniels, and Z. Li, Placement and Compaction of Nonconvex Polygons for Clothing Manufacture, in Proc. 4th Canad. Conf. Comput. Geom., pp. 236-243, 1992.
[22]
F. P. Prepaxata and M. I. Shamos, Computational Geometry: An Introduction, Springer-Verlag, New York, 1985.
[23]
T. Radzik, Newton's Method for Fractional Combinatorial Optimization, in Proc. 33rd Annual IEEE Symposium on Foundations of Computer Science, pp. 659-669, 1992.
[24]
S. Schaible, Fractional Programming, Handbook of Global Optimization, R. Horst and P. M. Pardalos (eds.), Kluwer Academic Publishers, pp. 495-608, 1995.
[25]
H. Yamashita, E~cient Algorithms for Minimizing the Sum and the Product of Linear Fractional Functions, Master Thesis, Dept. of Industrial Engineering and Management, Tokyo Institute of Technology, 1997.

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
SODA '00: Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
February 2000
965 pages
ISBN:0898714532

Sponsors

Publisher

Society for Industrial and Applied Mathematics

United States

Publication History

Published: 01 February 2000

Check for updates

Qualifiers

  • Article

Acceptance Rates

Overall Acceptance Rate 411 of 1,322 submissions, 31%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)45
  • Downloads (Last 6 weeks)5
Reflects downloads up to 15 Sep 2024

Other Metrics

Citations

Cited By

View all

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media