Pages that link to "Item:Q1764759"

The following pages link to A survey on Benders decomposition applied to fixed-charge network design problems (Q1764759):

Displaying 48 items.

• Mixed-integer programming approaches for the tree \(t^*\)-spanner problem (Q2329685) (← links)
• A genetic algorithm based on relaxation induced neighborhood search in a local branching framework for capacitated multicommodity network design (Q2357911) (← links)
• A Benders' decomposition algorithm for optimizing distribution of perishable products considering postharvest biological behavior in agri-food supply chain: a case study of tomato (Q2358178) (← links)
• Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support (Q2374364) (← links)
• Solving a capacitated hub location problem (Q2384615) (← links)
• Some concepts of the fuzzy multicommodity flow problem and their application in fuzzy network design (Q2390056) (← links)
• An interior-point Benders based branch-and-cut algorithm for mixed integer programs (Q2442074) (← links)
• On generating maximal nondominated Benders cuts (Q2442075) (← links)
• Optimal engineering design via Benders' decomposition (Q2442087) (← links)
• Solution of preemptive multi-objective network design problems applying Benders decomposition method (Q2442088) (← links)
• Estimating the parameters of a fatigue model using Benders' decomposition (Q2442091) (← links)
• Service network design models for two-tier city logistics (Q2448205) (← links)
• Optimum synthesis of discrete capacitated networks with multi-terminal commodity flow requirements (Q2468776) (← links)
• Solving network design problems via iterative aggregation (Q2516352) (← links)
• A note on the selection of Benders' cuts (Q2638375) (← links)
• The electric location-routing problem with heterogeneous fleet: formulation and Benders decomposition approach (Q2668681) (← links)
• Network scheduling problem with cross-docking and loading constraints (Q2668719) (← links)
• A robust optimization model for distribution network design under a mixed integer set of scenarios (Q2669596) (← links)
• New partial aggregations for multicommodity network flow problems: an application to the fixed-charge network design problem (Q2669599) (← links)
• Benders decomposition for network design covering problems (Q2669611) (← links)
• A scaleable projection-based branch-and-cut algorithm for the \(p\)-center problem (Q2673558) (← links)
• Decomposition algorithms for solving the minimum weight maximal matching problem (Q2811314) (← links)
• Convexity and optimization with copulæ structured probabilistic constraints (Q2817219) (← links)
• Exact approaches to the single-source network loading problem (Q2892148) (← links)
• Electricity Distribution Planning Model: A Network Design Approach For Solving The Master Problem Of The Benders Decomposition Method. (Q3142073) (← links)
• Tailoring Benders decomposition for uncapacitated network design (Q3730370) (← links)
• A Combined Matheuristic for the Piecewise Linear Multicommodity Network Flow Problem (Q4602333) (← links)
• تخصیص بودجه ی بهینه به منظور افزایش ایمنی محور شیراز-آباده به روش تجزیه بندر (Q4615710) (← links)
• Accelerating the Benders Decomposition Method: Application to Stochastic Network Design Problems (Q4637497) (← links)
• Accelerating benders decomposition with heuristicmaster problem solutions (Q4904321) (← links)
• A Closest Benders Cut Selection Scheme for Accelerating the Benders Decomposition Algorithm (Q5058020) (← links)
• The Benders Dual Decomposition Method (Q5130513) (← links)
• Projective Cutting-Planes (Q5221062) (← links)
• An exact approach for the multicommodity network optimization problem with a step cost function (Q5244303) (← links)
• Affine recourse for the robust network design problem: Between static and dynamic routing (Q5326787) (← links)
• Benders decomposition approach for the robust network design problem with flow bifurcations (Q5326799) (← links)
• A Benders Decomposition for Hub Location Problems Arising in Public Transport (Q5391891) (← links)
• A scheme for determining vehicle routes based on Arc-based service network design (Q5881488) (← links)
• Optimization in liner shipping (Q5892394) (← links)
• Optimization in liner shipping (Q5915966) (← links)
• Affine routing for robust network design (Q6065910) (← links)
• Models for the two‐dimensional rectangular single large placement problem with guillotine cuts and constrained pattern (Q6067889) (← links)
• Benders-type branch-and-cut algorithms for capacitated facility location with single-sourcing (Q6113311) (← links)
• A review of decentralized optimization focused on information flows of decomposition algorithms (Q6164389) (← links)
• Integrated optimal scheduling and routing of repair crew and relief vehicles after disaster: a novel hybrid solution approach (Q6179230) (← links)
• A sequential reduction algorithm for the large-scale fixed-charge network flow problems (Q6542455) (← links)
• Cluster before you hallucinate: node-capacitated network design and energy efficient routing (Q6550988) (← links)
• Mathematical formulations for consistent travelling salesman problems (Q6555132) (← links)