Pages that link to "Item:Q3270239"

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

Displaying 50 items.

• Parallel processors for planning under uncertainty (Q751510) (← links)
• On the convergence of cross decomposition (Q752000) (← links)
• Numerical behavior of LP algorithms based upon the decomposition principle (Q760768) (← links)
• A shortest path-based approach to the multileaf collimator sequencing problem (Q765342) (← links)
• Bi-level programming problem in the supply chain and its solution algorithm (Q781333) (← links)
• Convergence behavior of decomposition algorithms for linear programs (Q799585) (← links)
• Die Bedeutung des Operations Research fuer die hierarchische Produktionsplanung (Q806849) (← links)
• A nonlinear bilevel model for analysis of electric utility demand-side planning issues (Q807419) (← links)
• About Lagrangian methods in integer optimization (Q817183) (← links)
• On compact formulations for integer programs solved by column generation (Q817199) (← links)
• Airline crew scheduling: state-of-the-art (Q817210) (← links)
• Developing childhood vaccine administration and inventory replenishment policies that minimize open vial wastage (Q827111) (← links)
• Statistical estimation of operating reserve requirements using rolling horizon stochastic optimization (Q827124) (← links)
• Decomposition-based heuristic for the zoning and crop planning problem with adjacency constraints (Q828768) (← links)
• Decomposition theory for multidisciplinary design optimization problems with mixed integer quasiseparable subsystems (Q833418) (← links)
• A comparison of five heuristics for the multiple depot vehicle scheduling problem (Q835636) (← links)
• Combining column generation and constraint programming to solve the tail assignment problem (Q846141) (← links)
• A generalization of column generation to accelerate convergence (Q847856) (← links)
• A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times (Q853028) (← links)
• The new Fundamental Tree Algorithm for production scheduling of open pit mines (Q856303) (← links)
• Managing large fixed costs in vehicle routing and crew scheduling problems solved by column generation (Q856697) (← links)
• Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (Q857326) (← links)
• A branch-and-price algorithm for the capacitated facility location problem (Q864031) (← links)
• Composite-variable modeling for service parts logistics (Q867536) (← links)
• A matrix generation approach for eigenvalue optimization (Q868452) (← links)
• In situ column generation for a cutting-stock problem (Q868997) (← links)
• A heuristic for the long-term electricity generation planning problem using the Bloom and Gallant formulation (Q877611) (← links)
• A branch-and-price algorithm to solve the molten iron allocation problem in iron and steel industry (Q878576) (← links)
• Balanced allocation mechanism: an optimal mechanism for multiple keywords sponsored search auctions (Q903629) (← links)
• MSLiP: A computer code for the multistage stochastic linear programming problem (Q914552) (← links)
• Goal programming in the context of the assignment problem and a computationally effective solution method (Q929411) (← links)
• A Branch and Price algorithm for the \(k\)-splittable maximum flow problem (Q937408) (← links)
• Column generation heuristics for multiple machine, multiple orders per job scheduling problems (Q940892) (← links)
• George Dantzig in the development of economic analysis (Q951089) (← links)
• A branch-and-cut approach to the crossing number problem (Q951113) (← links)
• The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times (Q955327) (← links)
• A mixed integer programming model for multiple stage adaptive testing (Q958075) (← links)
• Exact algorithms for the matrix bid auction (Q958442) (← links)
• The manpower allocation problem with time windows and job-teaming constraints: A branch-and-price approach (Q958447) (← links)
• Towards a practical parallelisation of the simplex method (Q970132) (← links)
• Multi-dimensional bin packing problems with guillotine constraints (Q976021) (← links)
• A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes (Q976033) (← links)
• Application of particle swarm optimization algorithm for solving bi-level linear programming problem (Q980016) (← links)
• Maximum flow problem on dynamic generative network flows with time-varying bounds (Q988972) (← links)
• A branch-and-price algorithm for placement routing for a multi-head beam-type component placement tool (Q991821) (← links)
• Column generation decomposition with the degenerate constraints in the subproblem (Q992573) (← links)
• A column generation based heuristic for sensor placement, activity scheduling and data routing in wireless sensor networks (Q992709) (← links)
• Dantzig-Wolfe and block coordinate-descent decomposition in large-scale integrated refinery-planning (Q1010307) (← links)
• A framework for collaborative planning and state-of-the-art (Q1017944) (← links)
• Efficient heuristics for two-echelon spare parts inventory systems with an aggregate mean waiting time constraint per local warehouse (Q1018257) (← links)