Integer Programming and Combinatorial Optimization
From MaRDI portal
Publication:5712452
DOI10.1007/b97946zbMath1092.90529OpenAlexW2484779063MaRDI QIDQ5712452
Gianni Codato, Matteo Fischetti
Publication date: 23 December 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b97946
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Related Items
Dealing with time in the multiple traveling salespersons problem with moving targets, Exact Branch-Price-and-Cut for a Hospital Therapist Scheduling Problem with Flexible Service Locations and Time-Dependent Location Capacity, Irreducible infeasible subsystems of semidefinite systems, Designing a portfolio-based closed-loop supply chain network for dairy products with a financial approach: accelerated benders decomposition algorithm, A two-phase relaxation-based heuristic for the maximum feasible subsystem problem, A branch-and-cut approach to the crossing number problem, A multi-level search strategy for the 0-1 multidimensional knapsack problem, Transmission network investment using incentive regulation: a disjunctive programming approach, Branch-and-cut-and-price for the cardinality-constrained multi-cycle problem in kidney exchange, The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method, Integer-programming software systems