The following pages link to CPLEX (Q16269):
Displaying 50 items.
- Robust optimization for the cyclic hoist scheduling problem (Q300031) (← links)
- A hierarchical compromise model for the joint optimization of recovery operations and distribution of emergency goods in Humanitarian logistics (Q336844) (← links)
- A Lagrangian heuristic for sprint planning in agile software development (Q336900) (← links)
- Branch and bound for the cutwidth minimization problem (Q339558) (← links)
- A hybrid approach of bundle and Benders applied large mixed linear integer problem (Q364462) (← links)
- GLOMIQO: global mixed-integer quadratic optimizer (Q367170) (← links)
- A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size (Q439486) (← links)
- Algorithm runtime prediction: methods \& evaluation (Q490455) (← links)
- New multi-commodity flow formulations for the pooling problem (Q524906) (← links)
- A decomposition heuristic for the maximal covering location problem (Q606191) (← links)
- The nearest point problem in a polyhedral set and its extensions (Q694540) (← links)
- Successive convex approximations to cardinality-constrained convex programs: a piecewise-linear DC approach (Q742312) (← links)
- Efficient reformulation and solution of a nonlinear PDE-controlled flow network model (Q841133) (← links)
- Coverage by directional sensors in randomly deployed wireless sensor networks (Q857758) (← links)
- Improved rolling horizon approaches to the aircraft sequencing problem (Q892901) (← links)
- A parallel interior point decomposition algorithm for block angular semidefinite programs (Q969720) (← links)
- Scheduling internal audit activities: a stochastic combinatorial optimization problem (Q975756) (← links)
- Evaluating project completion time in project networks with discrete random activity durations (Q1017440) (← links)
- Reformulation in mathematical programming: An application to quantum chemistry (Q1025997) (← links)
- Relax and fix heuristics to solve one-stage one-machine lot-scheduling models for small-scale soft drink plants (Q1040968) (← links)
- Multicommodity network flows: The impact of formulation on decomposition (Q1321667) (← links)
- Probabilistic programming with discrete distributions and precedence constrained knapsack polyhedra (Q1396210) (← links)
- An interactive procedure dedicated to a bicriteria plant location model. (Q1413829) (← links)
- A Benders decomposition-based framework for solving quay crane scheduling problems (Q1622801) (← links)
- Reformulations and an exact algorithm for unrelated parallel machine scheduling problems with setup times (Q1628056) (← links)
- The fixed charge transportation problem: a strong formulation based on Lagrangian decomposition and column generation (Q1630276) (← links)
- New exact approaches and approximation results for the penalized knapsack problem (Q1634770) (← links)
- The traveling purchaser problem with time-dependent quantities (Q1652259) (← links)
- A hybrid integer and constraint programming approach to solve nurse rostering problems (Q1652269) (← links)
- A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints (Q1694297) (← links)
- The continuous single source location problem with capacity and zone-dependent fixed cost: models and solution approaches (Q1695018) (← links)
- A POPMUSIC-based approach for the berth allocation problem under time-dependent limitations (Q1695784) (← links)
- Binary decision rules for multistage adaptive mixed-integer optimization (Q1702781) (← links)
- Algorithms for electric vehicle scheduling in large-scale mobility-on-demand schemes (Q1711890) (← links)
- Linear models for stockpiling in open-pit mine production scheduling problems (Q1753425) (← links)
- Attractive orienteering problem with proximity and timing interactions (Q1754098) (← links)
- A probabilistic approach to pickup and delivery problems with time window uncertainty (Q1755385) (← links)
- Integration of progressive hedging and dual decomposition in stochastic integer programs (Q1785365) (← links)
- Centered solutions for uncertain linear equations (Q1789636) (← links)
- Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations (Q1925777) (← links)
- The project scheduling problem with irregular starting time costs (Q1969764) (← links)
- An overview of MINLP algorithms and their implementation in Muriqui optimizer (Q2178345) (← links)
- A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems (Q2255968) (← links)
- Electricity market clearing with improved scheduling of stochastic production (Q2256346) (← links)
- Optimally configuring a measurement system to detect diversions from a nuclear fuel cycle (Q2327680) (← links)
- Representations of quadratic combinatorial optimization problems: a case study using quadratic set covering and quadratic knapsack problems (Q2329727) (← links)
- Computational techniques for model predictive control of large-scale systems with continuous-valued and discrete-valued inputs (Q2375604) (← links)
- Algorithms for art gallery illumination (Q2397430) (← links)
- A linear programming embedded genetic algorithm for an integrated cell formation and lot sizing considering product quality (Q2426557) (← links)
- Exact solutions to linear programming problems (Q2467437) (← links)
