PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Lodi, Andrea"

Author of the publication

copydeleteadd this publication to your clipboard
A Study on the Computational Complexity of the Bilevel Knapsack Problem.

, , , and . SIAM Journal on Optimization, 24 (2): 823-838 (2014)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Dr. Andrea Thom University of Stuttgart

Andrea Loi University of Stuttgart

Andrea Talmann University of Stuttgart

Jun. -Prof. Dr. Andrea Iannelli University of Stuttgart

Dr. Andrea Zappe University of Stuttgart

 

Other publications of authors with the same name

A Polyhedral Approach to Simplified Crew Scheduling and Vehicle Scheduling Problems., , , and . Management Science, 47 (6): 833-850 (2001)A feasibility pump heuristic for general mixed-integer problems., , and . Discrete Optimization, 4 (1): 63-76 (2007)Erratum to: MIR closures of polyhedral sets., , and . Math. Program., 123 (2): 485-486 (2010)A Feasibility Pump for mixed integer nonlinear programs., , , and . Math. Program., 119 (2): 331-352 (2009)MIPping Closures: An Instant Survey., and . Graphs and Combinatorics, 23 (Supplement-1): 233-243 (2007)Design and implementation of a reconfigurable heterogeneous multiprocessor SoC., , , , , , , and . CICC, page 93-96. IEEE, (2006)A dynamically adaptive DSP for heterogeneous reconfigurable platforms., , , , , , , , and . DATE, page 9-14. EDA Consortium, San Jose, CA, USA, (2007)Approximation Algorithms for the Capacitated Multi-Item Lot-Sizing Problem via Flow-Cover Inequalities., , and . Math. Oper. Res., 33 (2): 461-474 (2008)Scheduling M2M traffic over LTE uplink of a dense small cells network., , , and . ISWCS, page 760-764. IEEE, (2015)Improving spectral bounds for clustering problems by Lagrangian relaxation., , and . ITOR, 18 (6): 647-661 (2011)