From post

Valid Inequalities for Time-Indexed Formulations of the Runway Scheduling Problem.

, , , и . DOOR (Supplement), том 1623 из CEUR Workshop Proceedings, стр. 787-790. CEUR-WS.org, (2016)

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.

 

Другие публикации лиц с тем же именем

A computational study of dicut reformulation for the Single Source Capacitated Facility Location problem., , и . Stud. Inform. Univ., 9 (3): 21-42 (2011)A compact formulation for the base station deployment problem in wireless networks., , и . Networks, 82 (1): 52-67 (июля 2023)A Steiner arborescence model for the feeder reconfiguration in electric distribution networks., , и . Eur. J. Oper. Res., 164 (2): 505-509 (2005)A penalty function heuristic for the resource constrained shortest path problem., , и . Eur. J. Oper. Res., 142 (2): 221-230 (2002)Improving ontology alignment through memetic algorithms., , , , и . FUZZ-IEEE, стр. 1783-1790. IEEE, (2011)Valid Inequalities for Time-Indexed Formulations of the Runway Scheduling Problem., , , и . DOOR (Supplement), том 1623 из CEUR Workshop Proceedings, стр. 787-790. CEUR-WS.org, (2016)Computational experience with general cutting planes for the Set Covering problem., , и . Oper. Res. Lett., 37 (1): 16-20 (2009)Computational study of large-scale p -Median problems., , и . Math. Program., 109 (1): 89-114 (2007)A LP-based heuristic for a time-constrained routing problem., , и . Eur. J. Oper. Res., 173 (1): 120-124 (2006)Solving a fuel delivery problem by heuristic and exact approaches., , и . Eur. J. Oper. Res., 152 (1): 170-179 (2004)