The following pages link to CPLEX (Q16269):
Displaying 50 items.
- Lagrangean relaxation with clusters for point-feature cartographic label placement problems (Q2468473) (← links)
- Mixed-integer programming models for an employee scheduling problem with multiple shifts and work locations (Q2468736) (← links)
- Towards a practical engineering tool for rostering (Q2468743) (← links)
- A queuing network model for the management of berth crane operations (Q2471220) (← links)
- Conflict analysis in mixed integer programming (Q2471271) (← links)
- Symmetric ILP: Coloring and small integers (Q2471273) (← links)
- A feasibility pump heuristic for general mixed-integer problems (Q2471275) (← links)
- Improving the feasibility pump (Q2471276) (← links)
- Using mixed-integer programming to solve power grid blackout problems (Q2471280) (← links)
- Min-Max MPC based on a network problem (Q2474457) (← links)
- Optimizing over the split closure (Q2476990) (← links)
- Projected Chvátal-Gomory cuts for mixed integer linear programs (Q2476991) (← links)
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations (Q2476994) (← links)
- Compact linearization for binary quadratic problems (Q2477615) (← links)
- An optimization problem in the electricity market (Q2477620) (← links)
- The \(p\)-median problem under uncertainty (Q2477661) (← links)
- Recovering an optimal LP basis from an optimal dual solution (Q2480056) (← links)
- Reformulation of the support set selection problem in the logical analysis of data (Q2480202) (← links)
- Iterative solution methods for beam angle and fluence map optimization in intensity modulated radiation therapy planning (Q2481577) (← links)
- A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes (Q2481606) (← links)
- A branch-and-price approach for integrating nurse and surgery scheduling (Q2482743) (← links)
- An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation (Q2482754) (← links)
- Furniture supply chain tactical planning optimization using a time decomposition approach (Q2482778) (← links)
- Constraint programming for computing non-stationary \((R, S)\) inventory policies (Q2482781) (← links)
- The linear ordering problem with cumulative costs (Q2482806) (← links)
- A parallel multistart algorithm for the closest string problem (Q2483510) (← links)
- Beam search heuristic to solve stochastic integer problems under probabilistic constraints (Q2484339) (← links)
- A stochastic programming approach for supply chain network design under uncertainty (Q2484345) (← links)
- Joint routing and wavelength assignment in wavelength division multiplexing networks for permanent and reliable paths (Q2485164) (← links)
- Aggregate production planning for a continuous reconfigurable manufacturing process (Q2485173) (← links)
- A genetic algorithm for the project assignment problem (Q2485176) (← links)
- A branch-and-cut algorithm for scheduling of projects with variable-intensity activities (Q2487846) (← links)
- A trust-region method for nonlinear bilevel programming: algorithm and computational exper\-ience (Q2488050) (← links)
- Using \(xQx\) to model and solve the uncapacitated task allocation problem (Q2488221) (← links)
- Exploiting semidefinite relaxations in constraint programming (Q2489123) (← links)
- A hybrid setup for a hybrid scenario: combining heuristics for the home health care problem (Q2489128) (← links)
- Accelerating column generation for aircraft scheduling using constraint propagation (Q2489131) (← links)
- Bounds for the single source modular capacitated plant location problem (Q2489136) (← links)
- Variable neighborhood search and local branching (Q2489139) (← links)
- Heuristics for a bidding problem (Q2489281) (← links)
- Best compromise solution for a new multiobjective scheduling problem (Q2489291) (← links)
- The multiple disposal facilities and multiple inventory locations rollon-rolloff vehicle routing problem (Q2489310) (← links)
- Multiprocessor scheduling under precedence constraints: polyhedral results (Q2489902) (← links)
- A branch-and-cut algorithm for graph coloring (Q2489906) (← links)
- Load balancing and capacity constraints in a hierarchical location model (Q2490178) (← links)
- Hyper-sparsity in the revised simplex method and how to exploit it (Q2490370) (← links)
- A LP-based heuristic for a time-constrained routing problem (Q2491773) (← links)
- A constraint generation algorithm for large scale linear programs using multiple-points separation (Q2492707) (← links)
- Global solution approach for a nonconvex MINLP problem in product portfolio optimization (Q2494289) (← links)
- The million-variable ``march'' for stochastic combinatorial optimization (Q2494291) (← links)
