Some searches may not work properly. We apologize for the inconvenience.
My bibliography Save this articleA method for convex curve approximation
Author
Abstract
Suggested Citation
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Y. P. Aneja & K. P. K. Nair, 1979. "Bicriteria Transportation Problem," Management Science, INFORMS, vol. 25(1), pages 73-78, January.
- Lee, Haijune & Simin Pulat, P., 1991. "Bicriteria network flow problems: Continuous case," European Journal of Operational Research, Elsevier, vol. 51(1), pages 119-126, March.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Kathrin Klamroth & Margaret M. Wiecek, 2002. "A Bi-Objective Median Location Problem With a Line Barrier," Operations Research, INFORMS, vol. 50(4), pages 670-679, August.
- Siem, A.Y.D. & den Hertog, D. & Hoffmann, A.L., 2005. "Multivariate Convex Approximation and Least-Norm Convex Data-Smoothing," Other publications TiSEM ad31ef2c-fc29-46c1-9b8f-6, Tilburg University, School of Economics and Management.
- A. Y. D. Siem & D. den Hertog & A. L. Hoffmann, 2011. "A Method for Approximating Univariate Convex Functions Using Only Function Value Evaluations," INFORMS Journal on Computing, INFORMS, vol. 23(4), pages 591-604, November.
- R. S. Burachik & C. Y. Kaya & M. M. Rizvi, 2014. "A New Scalarization Technique to Approximate Pareto Fronts of Problems with Disconnected Feasible Sets," Journal of Optimization Theory and Applications, Springer, vol. 162(2), pages 428-446, August.
- Hamacher, Horst W. & Pedersen, Christian Roed & Ruzika, Stefan, 2007. "Multiple objective minimum cost flow problems: A review," European Journal of Operational Research, Elsevier, vol. 176(3), pages 1404-1422, February.
- Siem, A.Y.D. & den Hertog, D. & Hoffmann, A.L., 2008.
"The effect of transformations on the approximation of univariate (convex) functions with applications to Pareto curves,"
European Journal of Operational Research, Elsevier, vol. 189(2), pages 347-362, September.
- Siem, A.Y.D. & den Hertog, D. & Hoffmann, A.L., 2006. "The Effect of Transformations on the Approximation of Univariate (Convex) Functions with Applications to Pareto Curves," Discussion Paper 2006-66, Tilburg University, Center for Economic Research.
- Siem, A.Y.D. & den Hertog, D. & Hoffmann, A.L., 2007. "A Method For Approximating Univariate Convex Functions Using Only Function Value Evaluations," Other publications TiSEM a3afe119-3957-4700-a895-4, Tilburg University, School of Economics and Management.
- Siem, A.Y.D. & den Hertog, D. & Hoffmann, A.L., 2005. "Multivariate Convex Approximation and Least-Norm Convex Data-Smoothing," Discussion Paper 2005-132, Tilburg University, Center for Economic Research.
- Siem, A.Y.D. & den Hertog, D. & Hoffmann, A.L., 2006.
"The Effect of Transformations on the Approximation of Univariate (Convex) Functions with Applications to Pareto Curves,"
Discussion Paper
2006-66, Tilburg University, Center for Economic Research.
- Siem, A.Y.D. & den Hertog, D. & Hoffmann, A.L., 2006. "The Effect of Transformations on the Approximation of Univariate (Convex) Functions with Applications to Pareto Curves," Other publications TiSEM 6a6f7eff-fa7e-4531-84e1-6, Tilburg University, School of Economics and Management.
- Esmaeil Keyvanshokooh & Pooyan Kazemian & Mohammad Fattahi & Mark P. Van Oyen, 2022. "Coordinated and Priority‐Based Surgical Care: An Integrated Distributionally Robust Stochastic Optimization Approach," Production and Operations Management, Production and Operations Management Society, vol. 31(4), pages 1510-1535, April.
- Siem, A.Y.D. & den Hertog, D. & Hoffmann, A.L., 2007. "A Method For Approximating Univariate Convex Functions Using Only Function Value Evaluations," Discussion Paper 2007-67, Tilburg University, Center for Economic Research.
- Siem, A.Y.D., 2008. "Property preservation and quality measures in meta-models," Other publications TiSEM 259d3ed2-1a23-48fe-8af8-2, Tilburg University, School of Economics and Management.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Sedeno-Noda, A. & Gonzalez-Martin, C. & Gutierrez, J., 2005. "The biobjective undirected two-commodity minimum cost flow problem," European Journal of Operational Research, Elsevier, vol. 164(1), pages 89-103, July.
- Mishra, Sabyasachee & Khasnabis, Snehamay & Swain, Subrat, 2013. "Multi-entity perspective transportation infrastructure investment decision making," Transport Policy, Elsevier, vol. 30(C), pages 1-12.
- Sedeno-Noda, A. & Gonzalez-Martin, C., 2000. "The biobjective minimum cost flow problem," European Journal of Operational Research, Elsevier, vol. 124(3), pages 591-600, August.
- Hamacher, Horst W. & Pedersen, Christian Roed & Ruzika, Stefan, 2007. "Multiple objective minimum cost flow problems: A review," European Journal of Operational Research, Elsevier, vol. 176(3), pages 1404-1422, February.
- Minghe Sun, 2005. "Warm-Start Routines for Solving Augmented Weighted Tchebycheff Network Programs in Multiple-Objective Network Programming," INFORMS Journal on Computing, INFORMS, vol. 17(4), pages 422-437, November.
- S. Dutta & S. Acharya & Rajashree Mishra, 2016. "Genetic algorithm based fuzzy stochastic transportation programming problem with continuous random variables," OPSEARCH, Springer;Operational Research Society of India, vol. 53(4), pages 835-872, December.
- Zhong, Tao & Young, Rhonda, 2010. "Multiple Choice Knapsack Problem: Example of planning choice in transportation," Evaluation and Program Planning, Elsevier, vol. 33(2), pages 128-137, May.
- Aritra Pal & Hadi Charkhgard, 2019. "A Feasibility Pump and Local Search Based Heuristic for Bi-Objective Pure Integer Linear Programming," INFORMS Journal on Computing, INFORMS, vol. 31(1), pages 115-133, February.
- KIKOMBA KAHUNGU, Michaël & MABELA MAKENGO MATENDO, Rostin & M. NGOIE, Ruffin-Benoît & MAKENGO MBAMBALU, Fréderic & OKITONYUMBE Y.F, Joseph, 2013. "Les fondements mathématiques pour une aide à la décision du réseau de transport aérien : cas de la République Démocratique du Congo [Mathematical Foundation for Air Traffic Network Decision Aid : C," MPRA Paper 68533, University Library of Munich, Germany, revised Mar 2013.
- Przybylski, Anthony & Gandibleux, Xavier, 2017. "Multi-objective branch and bound," European Journal of Operational Research, Elsevier, vol. 260(3), pages 856-872.
- Singh, Preetvanti & Saxena, P. K., 2003. "The multiple objective time transportation problem with additional restrictions," European Journal of Operational Research, Elsevier, vol. 146(3), pages 460-476, May.
- Pankaj Gupta & Mukesh Mehlawat, 2007. "An algorithm for a fuzzy transportation problem to select a new type of coal for a steel manufacturing unit," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 15(1), pages 114-137, July.
- Przybylski, Anthony & Gandibleux, Xavier & Ehrgott, Matthias, 2008. "Two phase algorithms for the bi-objective assignment problem," European Journal of Operational Research, Elsevier, vol. 185(2), pages 509-533, March.
- Diclehan Tezcaner & Murat Köksalan, 2011. "An Interactive Algorithm for Multi-objective Route Planning," Journal of Optimization Theory and Applications, Springer, vol. 150(2), pages 379-394, August.
- Derbel, Bilel & Humeau, Jérémie & Liefooghe, Arnaud & Verel, Sébastien, 2014. "Distributed localized bi-objective search," European Journal of Operational Research, Elsevier, vol. 239(3), pages 731-743.
- Natashia Boland & Hadi Charkhgard & Martin Savelsbergh, 2015. "A Criterion Space Search Algorithm for Biobjective Mixed Integer Programming: The Triangle Splitting Method," INFORMS Journal on Computing, INFORMS, vol. 27(4), pages 597-618, November.
- Boland, Natashia & Charkhgard, Hadi & Savelsbergh, Martin, 2017. "The Quadrant Shrinking Method: A simple and efficient algorithm for solving tri-objective integer programs," European Journal of Operational Research, Elsevier, vol. 260(3), pages 873-885.
- Andrzej Jaszkiewicz & Thibaut Lust, 2017. "Proper balance between search towards and along Pareto front: biobjective TSP case study," Annals of Operations Research, Springer, vol. 254(1), pages 111-130, July.
- Anthony Przybylski & Xavier Gandibleux & Matthias Ehrgott, 2010. "A Recursive Algorithm for Finding All Nondominated Extreme Points in the Outcome Set of a Multiobjective Integer Programme," INFORMS Journal on Computing, INFORMS, vol. 22(3), pages 371-386, August.
- Cacchiani, Valentina & D’Ambrosio, Claudia, 2017. "A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs," European Journal of Operational Research, Elsevier, vol. 260(3), pages 920-933.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:97:y:1997:i:1:p:205-212. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.