IDEAS home Printed from https://ideas.repec.org/f/ppa772.html
   My authors  Follow this author

Laura Palagi

Personal Details

First Name:Laura
Middle Name:
Last Name:Palagi
Suffix:
RePEc Short-ID:ppa772
[This author has chosen not to make the email address public]
http://www.dis.uniroma1.it/~palagi

Affiliation

Dipartimento di Ingegneria Informatica, Automatica e Gestionale "Antonio Ruberti"
Facoltà di Ingegneria dell'Informazione Informatica e Statistica
"Sapienza" Università di Roma

Roma, Italy
http://www.dis.uniroma1.it/

: +390677274140
+39 0677274129

RePEc:edi:dirosit (more details at EDIRC)

Research output

as
Jump to: Working papers Articles

Working papers

  1. Giorgio Grani & Gianmaria Leo & Laura Palagi & Mauro Piacentini, 2016. "Revenue Management: a Market-Service decomposition approach for the Sales Based Integer Program model," DIAG Technical Reports 2016-04, Department of Computer, Control and Management Engineering, Universita' degli Studi di Roma "La Sapienza".
  2. Andrea Manno & Laura Palagi & Simone Sagratella, 2014. "A Class of Convergent Parallel Algorithms for SVMs Training," DIAG Technical Reports 2014-17, Department of Computer, Control and Management Engineering, Universita' degli Studi di Roma "La Sapienza".
  3. Christoph Buchheim & Marianna De Santis & Laura Palagi & Mauro Piacentini, 2012. "An Exact Algorithm for Quadratic Integer Minimization using Nonconvex Relaxations," DIS Technical Reports 2012-05, Department of Computer, Control and Management Engineering, Universita' degli Studi di Roma "La Sapienza".
  4. Immanuel M. Bomze & Luigi Grippo & Laura Palagi, 2010. "Unconstrained formulation of standard quadratic optimization problems," DIS Technical Reports 2010-12, Department of Computer, Control and Management Engineering, Universita' degli Studi di Roma "La Sapienza".
  5. Giampaolo Liuzzi & Laura Palagi & Mauro Piacentini, 2010. "On the convergence of a Jacobi-type algorithm for Singly Linearly-Constrained Problems Subject to simple Bounds," DIS Technical Reports 2010-01, Department of Computer, Control and Management Engineering, Universita' degli Studi di Roma "La Sapienza".
  6. Luigi Grippo & Laura Palagi & Mauro Piacentini & Veronica Piccialli, 2009. "An unconstrained approach for solving low rank SDP relaxations of {-1,1} quadratic problems," DIS Technical Reports 2009-13, Department of Computer, Control and Management Engineering, Universita' degli Studi di Roma "La Sapienza".

Articles

  1. Dellepiane, Umberto & Palagi, Laura, 2015. "Using SVM to combine global heuristics for the Standard Quadratic Problem," European Journal of Operational Research, Elsevier, vol. 241(3), pages 596-605.
  2. Immanuel Bomze & Luigi Grippo & Laura Palagi, 2012. "Unconstrained formulation of standard quadratic optimization problems," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 20(1), pages 35-51, April.
  3. Gianni Di Pillo & Stefano Lucidi & Laura Palagi, 2005. "Convergence to Second-Order Stationary Points of a Primal-Dual Algorithm Model for Nonlinear Programming," Mathematics of Operations Research, INFORMS, vol. 30(4), pages 897-915, November.
  4. A. Ciancimino & G. Inzerillo & S. Lucidi & L. Palagi, 1999. "A Mathematical Programming Approach for the Solution of the Railway Yield Management Problem," Transportation Science, INFORMS, vol. 33(2), pages 168-181, May.

Citations

Many of the citations below have been collected in an experimental project, CitEc, where a more detailed citation analysis can be found. These are citations from works listed in RePEc that could be analyzed mechanically. So far, only a minority of all works could be analyzed. See under "Corrections" how you can help improve the citation analysis.

Working papers

  1. Immanuel M. Bomze & Luigi Grippo & Laura Palagi, 2010. "Unconstrained formulation of standard quadratic optimization problems," DIS Technical Reports 2010-12, Department of Computer, Control and Management Engineering, Universita' degli Studi di Roma "La Sapienza".

    Cited by:

    1. Immanuel Bomze & Chen Ling & Liqun Qi & Xinzhen Zhang, 2012. "Standard bi-quadratic optimization problems and unconstrained polynomial reformulations," Journal of Global Optimization, Springer, vol. 52(4), pages 663-687, April.
    2. Dellepiane, Umberto & Palagi, Laura, 2015. "Using SVM to combine global heuristics for the Standard Quadratic Problem," European Journal of Operational Research, Elsevier, vol. 241(3), pages 596-605.
    3. Tatyana Gruzdeva, 2013. "On a continuous approach for the maximum weighted clique problem," Journal of Global Optimization, Springer, vol. 56(3), pages 971-981, July.
    4. Wang, Xing & Tao, Chang-qi & Tang, Guo-ji, 2015. "A class of differential quadratic programming problems," Applied Mathematics and Computation, Elsevier, vol. 270(C), pages 369-377.

  2. Giampaolo Liuzzi & Laura Palagi & Mauro Piacentini, 2010. "On the convergence of a Jacobi-type algorithm for Singly Linearly-Constrained Problems Subject to simple Bounds," DIS Technical Reports 2010-01, Department of Computer, Control and Management Engineering, Universita' degli Studi di Roma "La Sapienza".

    Cited by:

    1. Andrea Manno & Laura Palagi & Simone Sagratella, 2014. "A Class of Convergent Parallel Algorithms for SVMs Training," DIAG Technical Reports 2014-17, Department of Computer, Control and Management Engineering, Universita' degli Studi di Roma "La Sapienza".

Articles

  1. Dellepiane, Umberto & Palagi, Laura, 2015. "Using SVM to combine global heuristics for the Standard Quadratic Problem," European Journal of Operational Research, Elsevier, vol. 241(3), pages 596-605.

    Cited by:

    1. Pedro Duarte Silva, A., 2017. "Optimization approaches to Supervised Classification," European Journal of Operational Research, Elsevier, vol. 261(2), pages 772-788.

  2. Immanuel Bomze & Luigi Grippo & Laura Palagi, 2012. "Unconstrained formulation of standard quadratic optimization problems," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 20(1), pages 35-51, April.
    See citations under working paper version above.
  3. Gianni Di Pillo & Stefano Lucidi & Laura Palagi, 2005. "Convergence to Second-Order Stationary Points of a Primal-Dual Algorithm Model for Nonlinear Programming," Mathematics of Operations Research, INFORMS, vol. 30(4), pages 897-915, November.

    Cited by:

    1. Hezhi Luo & Huixian Wu & Jianzhen Liu, 2013. "Some Results on Augmented Lagrangians in Constrained Global Optimization via Image Space Analysis," Journal of Optimization Theory and Applications, Springer, vol. 159(2), pages 360-385, November.

  4. A. Ciancimino & G. Inzerillo & S. Lucidi & L. Palagi, 1999. "A Mathematical Programming Approach for the Solution of the Railway Yield Management Problem," Transportation Science, INFORMS, vol. 33(2), pages 168-181, May.

    Cited by:

    1. Wang, Xinchang, 2017. "Static and dynamic resource allocation models for single-leg transportation markets with service disruptions," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 103(C), pages 87-108.
    2. H Jiang, 2008. "A Lagrangian relaxation approach for network inventory control of stochastic revenue management with perishable commodities," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(3), pages 372-380, March.
    3. Wang, Xinchang & Wang, Hua & Zhang, Xiaoning, 2016. "Stochastic seat allocation models for passenger rail transportation under customer choice," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 96(C), pages 95-112.
    4. Wang, Hua & Wang, Xinchang & Zhang, Xiaoning, 2017. "Dynamic resource allocation for intermodal freight transportation with network effects: Approximations and algorithms," Transportation Research Part B: Methodological, Elsevier, vol. 99(C), pages 83-112.
    5. Gabriel Bitran & René Caldentey, 2003. "An Overview of Pricing Models for Revenue Management," Manufacturing & Service Operations Management, INFORMS, vol. 5(3), pages 203-229, August.
    6. Pak, K. & Dekker, R. & Kindervater, G.A.P., 2003. "Airline Revenue Management with Shifting Capacity," ERIM Report Series Research in Management ERS-2003-091-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    7. Alexander Armstrong & Joern Meissner, 2010. "Railway Revenue Management: Overview and Models (Operations Research)," Working Papers MRG/0019, Department of Management Science, Lancaster University, revised Jul 2010.

More information

Research fields, statistics, top rankings, if available.

Statistics

Access and download statistics for all items

NEP Fields

NEP is an announcement service for new working papers, with a weekly report in each of many fields. This author has had 3 papers announced in NEP. These are the fields, ordered by number of announcements, along with their dates. If the author is listed in the directory of specialists for this field, a link is also provided.
  1. NEP-CMP: Computational Economics (2) 2012-07-14 2014-11-22

Corrections

All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. For general information on how to correct material on RePEc, see these instructions.

To update listings or check citations waiting for approval, Laura Palagi should log into the RePEc Author Service.

To make corrections to the bibliographic information of a particular item, find the technical contact on the abstract page of that item. There, details are also given on how to add or correct references and citations.

To link different versions of the same work, where versions have a different title, use this form. Note that if the versions have a very similar title and are in the author's profile, the links will usually be created automatically.

Please note that most corrections can take a couple of weeks to filter through the various RePEc services.

IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.