Embedded Files
12_A_Branch-and-Benders-Cut_Approach_to_Solve_the_Maximum_Flow_Blocker_Problem.pdf11_ILP Models and Column Generation for the Minimum Sum Coloring Problem.pdf10_Matheuristics for the Temporal Bin Packing Problem.pdf9_MIP Formulations for a Rich Real-World Lot-Sizing Problem with Setup Carryover.pdf8_Lower Bounding Techniques for DSATUR-based Branch and Bound.pdf7_ILP and CP Formulations for the Lazy Bureaucrat Problem.pdf6_Mathematical Formulations for the Balanced Vertex k-Separator Problem.pdf5_State Space Reduced Dynamic Programming for the Aircraft Sequencing Problem with Constrained Position Shifting.pdf4_A fast heuristic approach for train timetabling in a railway node.pdf3_Hybrid SDP Bounding Procedure.pdf2_Aircraft Sequencing Problems via a Rolling Horizon Algorithm.pdf1_Partial Convexification of General MIPs by Dantzig-Wolfe Reformulation.pdfNote: The PDFs available on this page are, unless otherwise stated, Author Accepted Manuscripts (AAMs) and not the final publisher-formatted Version of Record. Any publisher-formatted PDFs provided are open access and, where available, should be considered the original files. For each publication, a link to the publisher’s page is also provided, where the official published version can be accessed.
Page updated
Google Sites
Report abuse