Implementing Mixed Integer Column Generation
From MaRDI portal
Publication:5493637
DOI10.1007/0-387-25486-2_12zbMath1246.90108MaRDI QIDQ5493637
Publication date: 16 October 2006
Published in: Column Generation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/0-387-25486-2_12
90C11: Mixed integer programming
Related Items
Integral Column Generation for Set Partitioning Problems with Side Constraints, Analytics Branching and Selection for the Capacitated Multi-Item Lot Sizing Problem with Nonidentical Machines, Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation, Primal Heuristics for Branch and Price: The Assets of Diving Methods, Modeling and Solving Vehicle Routing Problems with Many Available Vehicle Types, Stabilizing branch‐and‐price for constrained tree problems, Using column generation to compute lower bound sets for bi-objective combinatorial optimization problems, Ray projection for optimizing polytopes with prohibitively many constraints in set-covering column generation, Column generation for service assignment in cloud-based manufacturing, Branch‐and‐price for energy optimization in multi‐hop wireless sensor networks, The Benders by batch algorithm: design and stabilization of an enhanced algorithm to solve multicut Benders reformulation of two-stage stochastic programs, A decomposition method for large scale MILPs, with performance guarantees and a power system application, Large-scale optimization with the primal-dual column generation method, Branch-and-price and constraint programming for solving a real-life technician dispatching problem, Exact approaches for lifetime maximization in connectivity constrained wireless multi-role sensor networks, A column generation approach for solving the examination-timetabling problem, Benders decomposition without separability: a computational study for capacitated facility location problems, A new formulation and approach for the black and white traveling salesman problem, A branch and price approach for deployment of multi-tier software services in clouds, Designing WDM optical networks using branch-and-price, A tutorial on column generation and branch-and-price for vehicle routing problems, Branching in branch-and-price: A generic scheme, Speeding up column generation for robust wireless network planning, Chebyshev center based column generation, A generalization of column generation to accelerate convergence, Decomposition schemes and acceleration techniques in application to production-assembly-distribution system design, Knapsack problems with setups, A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen, Dantzig-Wolfe decomposition approach to the vehicle assignment problem with demand uncertainty in a hybrid hub-and-spoke network, Branch-and-price and adaptive large neighborhood search for the truck and trailer routing problem with time windows, Dynamic constraint and variable aggregation in column generation, Liner shipping service scheduling and cargo allocation, An enhanced MILP-based branch-and-price approach to modularity density maximization on graphs, Rectangle blanket problem: binary integer linear programming formulation and solution algorithms, A stabilised scenario decomposition algorithm applied to stochastic unit commitment problems, A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints, The vehicle allocation problem: alternative formulation and branch-and-price method, Exact algorithms to minimize makespan on single and parallel batch processing machines, Dynamic location of modular manufacturing facilities with relocation of individual modules, Benders decomposition for the distributionally robust optimization of pricing and reverse logistics network design in remanufacturing systems, An extended goal programming model for the multiobjective integrated lot-sizing and cutting stock problem, A lexicographic pricer for the fractional bin packing problem, Effects of feasibility cuts in Lagrangian relaxation for a two-stage stochastic facility location and network flow problem, A column generation approach to multiscale capacity planning for power-intensive process networks, Power efficient uplink scheduling in SC-FDMA: benchmarking by column generation, Stabilized column generation for the temporal knapsack problem using dual-optimal inequalities, Mathematical programming approaches for dual multicast routing problem with multilayer risk cost, New formulations for variable cost and size bin packing problems with item fragmentation, A generic view of Dantzig--Wolfe decomposition in mixed integer programming, Constraint-specific recovery network for solving airline recovery problems, On routing and scheduling a fleet of resource-constrained vessels to provide ongoing continuous patrol coverage, A column generation-based heuristic for a rehabilitation patient scheduling and routing problem, Dual Inequalities for Stabilized Column Generation Revisited, A Horizon Decomposition Approach for the Capacitated Lot-Sizing Problem with Setup Times
