scientific article; zbMATH DE number 1175944
From MaRDI portal
Publication:4398361
zbMath1068.90505MaRDI QIDQ4398361
Alberto Caprara, Matteo Fischetti
Publication date: 19 July 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Problems of discrete optimization: challenges and main approaches to solve them, The Boolean Quadric Polytope, Finding multiple solutions to general integer linear programs, A branch-and-cut algorithm for the continuous error localization problem in data cleaning, Rank inequalities and separation algorithms for packing designs and sparse triple systems., Optimal selection of a portfolio of options under value-at-risk constraints: a scenario approach, Lexicography and degeneracy: Can a pure cutting plane algorithm work?, Binary Steiner trees: structural results and an exact solution approach, Cutting planes in integer and mixed integer programming, Branch and cut methods for network optimization, An optimality cut for mixed integer linear programs, Frequency assignment in mobile radio systems using branch-and-cut techniques, Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems, Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading, A new separation algorithm for the Boolean quadric and cut polytopes, Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut, Optimisation of the interconnecting network of a UMTS radio mobile telephone system
