Pages that link to "Item:Q3392018"

The following pages link to Combinatorial Benders' Cuts for Mixed-Integer Linear Programming (Q3392018):

Displaying 50 items.

• On conic QPCCs, conic QCQPs and completely positive programs (Q312665) (← links)
• An exact algorithm for the static rebalancing problem arising in bicycle sharing systems (Q319656) (← links)
• Simulation-optimization approaches for water pump scheduling and pipe replacement problems (Q319761) (← links)
• A branch-and-Benders-cut method for nonlinear power design in green wireless local area networks (Q323507) (← links)
• Energy-aware survivable networks (Q325416) (← links)
• Combinatorial Benders cuts for decomposing IMRT fluence maps using rectangular apertures (Q336468) (← links)
• A mixed integer programming approach for the single machine problem with unequal release dates (Q337161) (← links)
• A combinatorial Benders' decomposition for the lock scheduling problem (Q337348) (← links)
• On the hop-constrained survivable network design problem with reliable edges (Q342080) (← links)
• A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support (Q403644) (← links)
• An LPCC approach to nonconvex quadratic programs (Q431005) (← links)
• The stop-and-drop problem in nonprofit food distribution networks (Q478060) (← links)
• Three modeling paradigms in mathematical programming (Q607499) (← links)
• On interval-subgradient and no-good cuts (Q613320) (← links)
• Generalized Benders' decomposition for topology optimization problems (Q652657) (← links)
• Buffer allocation in stochastic flow lines via sample-based optimization with initial bounds (Q747748) (← links)
• IIS branch-and-cut for joint chance-constrained stochastic programs and application to optimal vaccine allocation (Q992606) (← links)
• A Benders approach for computing lower bounds for the mirrored traveling tournament problem (Q1015323) (← links)
• The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design (Q1616826) (← links)
• A Benders decomposition-based framework for solving quay crane scheduling problems (Q1622801) (← links)
• A branch-and-check approach for a wind turbine maintenance scheduling problem (Q1651530) (← links)
• Logic based Benders' decomposition for orthogonal stock cutting problems (Q1652086) (← links)
• Branch-and-cut methods for the network design problem with vulnerability constraints (Q1652559) (← links)
• Combining Benders decomposition and column generation for multi-activity tour scheduling (Q1652589) (← links)
• Solving a selective dial-a-ride problem with logic-based Benders decomposition (Q1652651) (← links)
• Profit-maximization generation maintenance scheduling through bi-level programming (Q1681437) (← links)
• First-order dominance: stronger characterization and a bivariate checking algorithm (Q1717226) (← links)
• Scheduling two-way ship traffic for the Kiel Canal: model, extensions and a matheuristic (Q1734831) (← links)
• Computing and maximizing the exact reliability of wireless backhaul networks (Q1742207) (← links)
• Recursive logic-based Benders' decomposition for multi-mode outpatient scheduling (Q1751262) (← links)
• Optimizing invasive species management: a mixed-integer linear programming approach (Q1751811) (← links)
• Combinatorial Benders cuts for assembly line balancing problems with setups (Q1751843) (← links)
• The Benders decomposition algorithm: a literature review (Q1751891) (← links)
• Stochastic survivable network design problems: theory and practice (Q1752199) (← links)
• Optimization approaches to supervised classification (Q1753623) (← links)
• Disaggregated Benders decomposition and branch-and-cut for solving the budget-constrained dynamic uncapacitated facility location and network design problem (Q1754726) (← links)
• Mathematical models and decomposition methods for the multiple knapsack problem (Q1755383) (← links)
• A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment (Q1761180) (← links)
• Benders decomposition: solving binary master problems by enumeration (Q1785474) (← links)
• Regularized decomposition of large scale block-structured robust optimization problems (Q1789623) (← links)
• The determination of optimal treatment plans for volumetric modulated arc therapy (VMAT) (Q1991143) (← links)
• A Benders' decomposition algorithm with combinatorial cuts for the multi-manned assembly line balancing problem (Q1999621) (← links)
• Network design model to integrate shelter assignment with contraflow operations in emergency evacuation planning (Q2005795) (← links)
• Exact solution algorithms for the maximum flow problem with additional conflict constraints (Q2023909) (← links)
• Accelerating Benders decomposition for short-term hydropower maintenance scheduling (Q2028814) (← links)
• Exact solution techniques for two-dimensional cutting and packing (Q2029021) (← links)
• The multiple multidimensional knapsack with family-split penalties (Q2029273) (← links)
• Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework (Q2029367) (← links)
• A combinatorial Benders decomposition algorithm for parallel machine scheduling with working-time restrictions (Q2029954) (← links)
• An exact algorithm for the unidirectional quay crane scheduling problem with vessel stability (Q2029972) (← links)