Pages that link to "Item:Q3270239"

The following pages link to Decomposition Principle for Linear Programs (Q3270239):

Displaying 50 items.

• Globally optimal clusterwise regression by column generation enhanced with heuristics, sequencing and ending subset optimization (Q288987) (← links)
• Obtaining lower bounds from the progressive hedging algorithm for stochastic mixed-integer programs (Q291039) (← links)
• Operational transportation planning of freight forwarding companies in horizontal coalitions (Q296641) (← links)
• Branch-and-price and constraint programming for solving a real-life technician dispatching problem (Q296755) (← links)
• An optimization framework for the development of efficient one-way car-sharing systems (Q300047) (← links)
• Column generation approaches for the software clustering problem (Q301694) (← links)
• Decomposition based hybrid metaheuristics (Q319285) (← links)
• The discrete time window assignment vehicle routing problem (Q319363) (← links)
• An integrative cooperative search framework for multi-decision-attribute combinatorial optimization: application to the MDPVRP (Q319782) (← links)
• Coordinating decentralized linear programs by exchange of primal information (Q320089) (← links)
• Scheduling pumpoff operations in onshore oilfields under electric-power constraints (Q320129) (← links)
• The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: a branch-and-price approach (Q320623) (← links)
• A branch-and-price algorithm for stable workforce assignments with hierarchical skills (Q322747) (← links)
• Column generation based approaches for a tour scheduling problem with a multi-skill heterogeneous workforce (Q323020) (← links)
• Bin packing and cutting stock problems: mathematical models and exact algorithms (Q323473) (← links)
• Hybrid column generation for large-size covering integer programs: application to transportation planning (Q336412) (← links)
• A hybrid column generation with GRASP and path relinking for the network load balancing problem (Q336721) (← links)
• Mathematical programming algorithms for bin packing problems with item fragmentation (Q336982) (← links)
• A new formulation and approach for the black and white traveling salesman problem (Q337265) (← links)
• Combining simulated annealing with Lagrangian relaxation and weighted Dantzig-Wolfe decomposition for integrated design decisions in wireless sensor networks (Q337548) (← links)
• A branch-price-and-cut algorithm for the workover rig routing problem (Q339692) (← links)
• A constraint programming based column generation approach to nurse rostering problems (Q339698) (← links)
• Exact algorithms for the double vehicle routing problem with multiple stacks (Q342039) (← links)
• Hybrid methods for lot sizing on parallel machines (Q342050) (← links)
• Exactly solving packing problems with fragmentation (Q342536) (← links)
• A model-based approach and analysis for multi-period networks (Q353173) (← links)
• A stabilized structured Dantzig-Wolfe decomposition method (Q359629) (← links)
• Efficient techniques for the multi-period vehicle routing problem with time windows within a branch and price framework (Q363544) (← links)
• A hybrid approach of bundle and Benders applied large mixed linear integer problem (Q364462) (← links)
• Flexible weekly tour scheduling for postal service workers using a branch and price (Q398850) (← links)
• Elective course planning (Q420895) (← links)
• The constrained compartmentalized knapsack problem: mathematical models and solution methods (Q421557) (← links)
• Comparing branch-and-price algorithms for the multi-commodity \(k\)-splittable maximum flow problem (Q439370) (← links)
• Branch-and-price approach for the multi-skill project scheduling problem (Q479223) (← links)
• Turning restriction design in traffic networks with a budget constraint (Q486412) (← links)
• Exact and heuristic solution approaches for the integrated job scheduling and constrained network routing problem (Q496641) (← links)
• About the minimum mean cycle-canceling algorithm (Q499347) (← links)
• The binary search decomposition in a decentralized organization (Q599688) (← links)
• Exact decomposition approaches for Markov decision processes: a survey (Q606196) (← links)
• Optimization of oil tanker schedules by decomposition, column generation, and time-space network techniques (Q623730) (← links)
• A hybrid of genetic algorithm and particle swarm optimization for solving bi-level linear programming problem -- a case study on supply chain model (Q639161) (← links)
• An introduction to dynamic generative networks: minimum cost flow (Q651703) (← links)
• A robust framework for task-related resident scheduling (Q666983) (← links)
• Augmented Lagrangian method within L-shaped method for stochastic linear programs (Q669327) (← links)
• Solving bi-level linear programming problem through hybrid of immune genetic algorithm and particle swarm optimization algorithm (Q669445) (← links)
• The double pivot simplex method (Q684156) (← links)
• Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems (Q686998) (← links)
• Decomposition in general mathematical programming (Q689140) (← links)
• Polylithic modeling and solution approaches using algebraic modeling systems (Q691438) (← links)
• Efficient geometric operations on convex polyhedra, with an application to reachability analysis of hybrid systems (Q748756) (← links)