The following pages link to (Q4254875):
Displaying 50 items.
- Mixed-integer linear methods for layout-optimization of screening systems in recovered paper production (Q2357214) (← links)
- Cutting-plane-based algorithms for two branch vertices related spanning tree problems (Q2357824) (← links)
- Power efficient uplink scheduling in SC-FDMA: benchmarking by column generation (Q2358072) (← links)
- Tight MIP formulations for bounded up/down times and interval-dependent start-ups (Q2364487) (← links)
- Polyhedral aspects of score equivalence in Bayesian network structure learning (Q2364495) (← links)
- Convex hull of two quadratic or a conic quadratic and a quadratic inequality (Q2364498) (← links)
- Subadditive approaches in integer programming (Q2371344) (← links)
- Circulation of railway rolling stock: a branch-and-price approach (Q2384905) (← links)
- Mathematical programming approaches for dual multicast routing problem with multilayer risk cost (Q2393468) (← links)
- A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints (Q2397763) (← links)
- Lexicographical order in integer programming (Q2405486) (← links)
- A new approximation hierarchy for polynomial conic optimization (Q2419540) (← links)
- Finding the symmetry group of an LP with equality constraints and its application to classifying orthogonal arrays (Q2419587) (← links)
- Multi-objective unconstrained combinatorial optimization: a polynomial bound on the number of extreme supported solutions (Q2423818) (← links)
- On mixing sets arising in chance-constrained programming (Q2429465) (← links)
- Solving the electricity production planning problem by a column generation based heuristic (Q2434329) (← links)
- A cutting plane algorithm for graph coloring (Q2467348) (← links)
- Symmetric ILP: Coloring and small integers (Q2471273) (← links)
- Chromatic scheduling polytopes coming from the bandwidth allocation problem in point-to-multipoint radio access systems (Q2480207) (← links)
- On the asymmetric representatives formulation for the vertex coloring problem (Q2482105) (← links)
- A new model and hybrid approach for large scale inventory routing problems (Q2482782) (← links)
- Detecting infeasibility and generating cuts for mixed integer programming using constraint programming (Q2489122) (← links)
- A branch-and-cut algorithm for graph coloring (Q2489906) (← links)
- Solving a class of stochastic mixed-integer programs with branch and price (Q2502208) (← links)
- A semidefinite programming based polyhedral cut and price approach for the maxcut problem (Q2506169) (← links)
- Airport management: taxi planning (Q2507387) (← links)
- Upper and lower bounding procedures for the multiple knapsack assignment problem (Q2514873) (← links)
- A trust-region-based derivative free algorithm for mixed integer programming (Q2515071) (← links)
- A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting (Q2576248) (← links)
- Simple lifted cover inequalities and hard knapsack problems (Q2581317) (← links)
- Exact estimation of multiple directed acyclic graphs (Q2628883) (← links)
- A decomposition approach to solve a bilevel capacitated facility location problem with equity constraints (Q2629907) (← links)
- Augmented Lagrangian based hybrid subgradient method for solving aircraft maintenance routing problem (Q2668735) (← links)
- Solving the generalized multi-port container stowage planning problem by a matheuristic algorithm (Q2668804) (← links)
- Reinforcement learning for combinatorial optimization: a survey (Q2669503) (← links)
- A stand-alone branch-and-price algorithm for identical parallel machine scheduling with conflicts (Q2669559) (← links)
- A column generation tailored to electric vehicle routing problem with nonlinear battery depreciation (Q2669635) (← links)
- Discrete multi-module capacitated lot-sizing problems with multiple items (Q2670496) (← links)
- A rolling-horizon approach for multi-period optimization (Q2670577) (← links)
- A cut-and-branch algorithm for the quadratic knapsack problem (Q2673234) (← links)
- Integrated lot-sizing and one-dimensional cutting stock problem with usable leftovers (Q2675699) (← links)
- Mixed integer linear programming formulation techniques (Q2808240) (← links)
- A branch-and-cut-and-price approach for the capacitated \(m\)-ring-star problem (Q2840522) (← links)
- The minimum cut cover problem (Q2840718) (← links)
- Exploiting Symmetries in Polyhedral Computations (Q2849003) (← links)
- Column generation approach to line planning with various halting patterns - application to the Korean high-speed railway (Q2853407) (← links)
- An exact algorithm for the Steiner tree problem with delays (Q2883568) (← links)
- An improved interior-point cutting-plane method for binary quadratic optimization (Q2883644) (← links)
- An exact algorithm for the budget-constrained multiple knapsack problem (Q2885555) (← links)
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs (Q2897292) (← links)
