Pages that link to "Item:Q4770776"
From MaRDI portal
The following pages link to Validation of subgradient optimization (Q4770776):
Displaying 50 items.
- A multiperiod min-sum arborescence problem (Q260662) (← links)
- A cross-decomposition scheme with integrated primal-dual multi-cuts for two-stage stochastic programming investment planning problems (Q291046) (← links)
- Fast projection onto the simplex and the \(l_1\) ball (Q304269) (← links)
- Computing assortative mixing by degree with the \(s\)-metric in networks using linear programming (Q305479) (← links)
- Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies (Q319183) (← links)
- Integrated production and logistics planning: contract manufacturing and choice of air/surface transportation (Q319939) (← links)
- On the solution of multidimensional convex separable continuous knapsack problem with bounded variables (Q319990) (← links)
- Enhanced models and improved solution for competitive biofuel supply chain design under land use constraints (Q320925) (← links)
- Two fast algorithms for projecting a point onto the canonical simplex (Q327053) (← links)
- A hybrid Lagrangean heuristic with GRASP and path-relinking for set \(k\)-covering (Q336718) (← links)
- Generalized route planning model for hazardous material transportation with VaR and equity considerations (Q336917) (← links)
- Incorporating location, inventory and price decisions into a supply chain distribution network design problem (Q337462) (← links)
- Zone pricing for time-definite LTL freight transportation with elastic demand (Q337625) (← links)
- Heuristics for the multi-item capacitated lot-sizing problem with lost sales (Q339577) (← links)
- A hybrid Lagrangian-simulated annealing-based heuristic for the parallel-machine capacitated lot-sizing and scheduling problem with sequence-dependent setup times (Q342038) (← links)
- Lower bounds and exact algorithms for the quadratic minimum spanning tree problem (Q342052) (← links)
- Cluster Lagrangean decomposition in multistage stochastic optimization (Q342253) (← links)
- Lagrangian heuristics for the capacitated multi-plant lot sizing problem with multiple periods and items (Q342353) (← links)
- A hybrid approach of bundle and Benders applied large mixed linear integer problem (Q364462) (← links)
- Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem (Q490197) (← links)
- A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method (Q526844) (← links)
- Symmetric weight constrained traveling salesman problem: Local search (Q535615) (← links)
- Set covering-based surrogate approach for solving sup-\({\mathcal{T}}\) equation constrained optimization problems (Q540668) (← links)
- Two-direction subgradient method for non-differentiable optimization problems (Q581239) (← links)
- A Benders decomposition based heuristic for the hierarchical production planning problem (Q584066) (← links)
- Solving network manpower problems with side constraints (Q595507) (← links)
- Multiple machine continuous setup lotsizing with sequence-dependent setups (Q616801) (← links)
- A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs (Q683935) (← links)
- Multi-level multi-item lot size planning with limited resources and general manufacturing structure. (Q684381) (← links)
- Mixed-integer bilinear programming problems (Q687032) (← links)
- Capacitated emergency facility siting with multiple levels of backup (Q689256) (← links)
- Higher-level RLT or disjunctive cuts based on a partial enumeration strategy for 0-1 mixed-integer programs (Q691415) (← links)
- Experiments with LAGRASP heuristic for set \(k\)-covering (Q691433) (← links)
- New Lagrangian relaxation based algorithm for resource scheduling with homogeneous subproblems (Q700701) (← links)
- New bundle methods for solving Lagrangian relaxation dual problems (Q700752) (← links)
- Benefit sharing in holding situations (Q707151) (← links)
- Models for a traveling purchaser problem with additional side-constraints (Q709202) (← links)
- On efficient matheuristic algorithms for multi-period stochastic facility location-assignment problems (Q721958) (← links)
- Models and Lagrangian heuristics for a two-level lot-sizing problem with bounded inventory (Q747754) (← links)
- Heuristically guided algorithm for k-parity matroid problems (Q754224) (← links)
- Ein Subgradientenverfahren zur Klassifikation qualitativer Daten (Q761244) (← links)
- Large-scale mixed integer programming: Benders-type heuristics (Q789322) (← links)
- Solving capacitated clustering problems (Q799059) (← links)
- Dispatching a fishing trawler fleet in the Canadian Atlantic groundfish industry (Q807381) (← links)
- About Lagrangian methods in integer optimization (Q817183) (← links)
- Airline crew scheduling: state-of-the-art (Q817210) (← links)
- Non delayed relax-and-cut algorithms (Q817212) (← links)
- Multi-item spare parts systems with lateral transshipments and waiting time constraints (Q819107) (← links)
- Convergence and computational analyses for some variable target value and subgradient deflection methods (Q853561) (← links)
- Finding minimum and equitable risk routes for hazmat shipments (Q856784) (← links)
