Pages that link to "Item:Q3392018"
From MaRDI portal
The following pages link to Combinatorial Benders' Cuts for Mixed-Integer Linear Programming (Q3392018):
Displaying 50 items.
- Benders' decomposition for the balancing of assembly lines with stochastic demand (Q2030547) (← links)
- A framework for generalized Benders' decomposition and its application to multilevel optimization (Q2097644) (← links)
- A Benders decomposition algorithm for the maximum availability service facility location problem (Q2108127) (← links)
- Benders decomposition applied to profit maximizing hub location problem with incomplete hub network (Q2146970) (← links)
- Branch-and-cut-and-price for the electric vehicle routing problem with time windows, piecewise-linear recharging and capacitated recharging stations (Q2147168) (← links)
- New solution procedures for the order picker routing problem in U-shaped Pick areas with a movable depot (Q2152010) (← links)
- A logic-based Benders decomposition for microscopic railway timetable planning (Q2158004) (← links)
- Shattering inequalities for learning optimal decision trees (Q2170186) (← links)
- A Benders decomposition-based approach for logistics service network design (Q2184143) (← links)
- A compact mixed integer linear formulation for safe set problems (Q2228393) (← links)
- The minimum area spanning tree problem: formulations, Benders decomposition and branch-and-cut algorithms (Q2230399) (← links)
- An almost exact solution to the min completion time variance in a single machine (Q2239979) (← links)
- Identifying relatively irreducible infeasible subsystems of linear inequalities (Q2241565) (← links)
- Crowdshipping by employees of distribution centers: optimization approaches for matching supply and demand (Q2242299) (← links)
- Exact and heuristic algorithms for the fleet composition and periodic routing problem of offshore supply vessels with berth allocation decisions (Q2242377) (← links)
- Integrating operations and marketing decisions using delayed differentiation of products and guaranteed delivery time under stochastic demand (Q2253993) (← links)
- Logic-based Benders decomposition algorithm for contamination detection problem in water networks (Q2289916) (← links)
- A branch-and-Benders-cut approach for the fault tolerant regenerator location problem (Q2289917) (← links)
- A survey of network interdiction models and algorithms (Q2294622) (← links)
- Logic-based Benders decomposition for scheduling a batching machine (Q2333133) (← links)
- Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support (Q2374364) (← links)
- On generating maximal nondominated Benders cuts (Q2442075) (← links)
- Single-facility scheduling by logic-based Benders decomposition (Q2442086) (← links)
- A decomposition approach for solving a broadcast domination network design problem (Q2442092) (← links)
- Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints (Q2448160) (← links)
- Single machine scheduling with unequal release times and idle insert for minimizing the sum of maximum earliness and tardiness (Q2450493) (← links)
- Projected Chvátal-Gomory cuts for mixed integer linear programs (Q2476991) (← links)
- The multi-period multi-trip container drayage problem with release and due dates (Q2664453) (← links)
- The last-mile delivery process with trucks and drones under uncertain energy consumption (Q2664893) (← links)
- A column generation and combinatorial Benders decomposition algorithm for the selective dial-a-ride-problem (Q2669775) (← links)
- Logic-based benders decomposition with a partial assignment acceleration technique for avionics scheduling (Q2676319) (← links)
- The leave-worst-\(k\)-out criterion for cross validation (Q2693781) (← links)
- Theoretical and computational advances for network diversion (Q2811311) (← links)
- Branch-and-cut algorithms for the vehicle routing problem with trailers and transshipments (Q2811328) (← links)
- Convexity and optimization with copulæ structured probabilistic constraints (Q2817219) (← links)
- On the Finite Optimal Convergence of Logic-Based Benders’ Decomposition in Solving 0–1 Min-Max Regret Optimization Problems with Interval Costs (Q2835657) (← links)
- Benders Decomposition for Capacitated Network Design (Q2835663) (← links)
- Benders' cuts guided large neighborhood search for the traveling umpire problem (Q2892136) (← links)
- Combinatorial Benders' Cuts for the Strip Packing Problem (Q2935306) (← links)
- Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem (Q2940057) (← links)
- An Exact Decomposition Approach for the Real-Time Train Dispatching Problem (Q3195230) (← links)
- Logic-Based Benders Decomposition for Large-Scale Optimization (Q3296379) (← links)
- Branch and Price for Chance-Constrained Bin Packing (Q3386782) (← links)
- Benders Decomposition for Production Routing Under Demand Uncertainty (Q3465587) (← links)
- A nested benders decomposition approach for telecommunication network planning (Q3588806) (← links)
- Accelerating the Benders Decomposition Method: Application to Stochastic Network Design Problems (Q4637497) (← links)
- A Closest Benders Cut Selection Scheme for Accelerating the Benders Decomposition Algorithm (Q5058020) (← links)
- Team Orienteering with Time-Varying Profit (Q5084650) (← links)
- Integer Programming, Constraint Programming, and Hybrid Decomposition Approaches to Discretizable Distance Geometry Problems (Q5084653) (← links)
- Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem (Q5085469) (← links)
