swMATH4082MaRDI QIDQ16269FDOQ16269
Author name not available (Why is that?)
Official website: http://www-01.ibm.com/software/integration/optimization/cplex-optimizer/
Cited In (only showing first 100 items - show all)
- Distributed Constraint-Based Local Search
- Energy Minimizing Vehicle Routing Problem
- Crossdocking— Just in Time scheduling: an alternative solution approach
- Risk Aversion via Excess Probabilities in Stochastic Programs with Mixed-Integer Recourse
- Crossdocking—JIT scheduling with time windows
- The single allocation problem in the interacting three-hub network
- Title not available (Why is that?)
- Dynamic unit commitment problem of controlling a power system in a competitive electricity market
- Branch-and-price and constraint programming for solving a real-life technician dispatching problem
- Robust combinatorial optimization with variable cost uncertainty
- Medium range optimization of copper extraction planning under uncertainty in future copper prices
- Branch-and-price algorithm for the resilient multi-level hop-constrained network design
- A ``reduce and solve approach for the multiple-choice multidimensional knapsack problem
- Optimal relay node placement in delay constrained wireless sensor network design
- An optimization-based approach to sampled-data control of networked control systems with multiple delays
- Communication protocols for options and results in a distributed optimization environment
- Large margin classification with indefinite similarities
- The \(L\)-shape search method for triobjective integer programming
- On multi-objective optimization aided drawing of special graphs
- Nonparametric tests of collectively rational consumption behavior: an integer programming procedure
- Space engineering. Modeling and optimization with case studies
- Robust optimization for the cyclic hoist scheduling problem
- A pure \(L_1\)-norm principal component analysis
- A robust optimization approach to dispatching technicians under stochastic service times
- An integer programming approach to elective surgery scheduling: analysis and comparison based on a real case
- Multiperiod location-routing with decoupled time scales
- A decomposition approach for facility location and relocation problem with uncertain number of future facilities
- Enhancing RLT relaxations via a new class of semidefinite cuts
- A stochastic bi-objective location model for strategic reverse logistics
- A note on second-order stochastic dominance constraints induced by mixed-integer linear recourse
- Branch-and-cut approaches for chance-constrained formulations of reliable network design problems
- Computing equilibria in discounted dynamic games
- A sliding time window heuristic for open pit mine block sequencing
- MIP models for connected facility location: a theoretical and computational study
- Routing of uncertain traffic demands
- A two-stage stochastic programming model for scheduling replacements in sow farms
- Transshipment service through crossdocks with both soft and hard time windows
- Budgeting with bounded multiple-choice constraints.
- A 2-phase algorithm for solving the single allocation \(p\)-hub center problem
- A dynamic programming algorithm for the bilevel Knapsack problem
- A generic stochastic model for supply-and-return network design
- Assigning cross-trained workers to departments: a two-stage optimization model to maximize utility and skill improvement
- A branch-and-price algorithm for the capacitated facility location problem
- Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem
- Duty-period-based network model for crew rescheduling in European airlines
- The capacitated single-allocation hub location problem revisited: a note on a classical formulation
- A fast polynomial time algorithm for logistics network flows
- An optimization approach for planning daily drayage operations
- Global solution of optimization problems with signomial parts
- Minimizing makespan in two-stage hybrid cross docking scheduling problem
- Lower and upper bounds for a capacitated plant location problem with multicommodity flow
- New lower bounds based on column generation and constraint programming for the pattern minimization problem
- A lead-time based approach for planning rail-truck intermodal transportation of dangerous goods
- Solving the prize-collecting rural postman problem
- Optimal lines for railway systems
- Cost optimal allocation of rail passenger lines
- Piece-wise linear approximation of functions of two variables
- Upper and lower bounds for the single source capacitated location problem.
- Discrete facility location and routing of obnoxious activities.
- The final NETLIB-LP results
- Robust multiobjective optimization with application to Internet routing
- Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem
- Makespan minimization on single batch-processing machine via ant colony optimization
- An approximate dynamic programming approach to multidimensional knapsack problems
- URSA: a system for uniform reduction to SAT
- Robust network design: formulations, valid inequalities, and computations
- The transportation problem with exclusionary side constraints and two branch-and-bound algorithms
- Allocating fixed costs and resources via data envelopment analysis
- Human resources management at a marine container terminal
- A stochastic approach to a case study for product recovery network design
- Risk management with stochastic dominance models in energy systems with dispersed generation
- A cut-and-solve based algorithm for the single-source capacitated facility location problem
- A constraint programming approach for a batch processing problem with non-identical job sizes
- Lagrangian decomposition and mixed-integer quadratic programming reformulations for probabilistically constrained quadratic programs
- Branch-and-price-and-cut for the manpower routing problem with synchronization constraints
- A so-called cluster Benders decomposition approach for solving two-stage stochastic linear problems
- Improved lower bounds and exact algorithm for the capacitated arc routing problem
- Robust combinatorial optimization with variable budgeted uncertainty
- The time dependent traveling salesman problem: polyhedra and algorithm
- A two-phase heuristic approach to the bike repositioning problem
- Column generation extensions of set covering greedy heuristics
- Emergency evacuation problem for a multi-source and multi-destination transportation network: mathematical model and case study
- A multi-objective mathematical model for the industrial hazardous waste location-routing problem
- A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems
- Risk aversion for an electricity retailer with second-order stochastic dominance constraints
- A new mixed integer linear model for a rich vehicle routing problem with docking constraints
- An optimization model for storage yard management in transshipment hubs
- Surgical case scheduling as a generalized job shop scheduling problem
- Using mixed-integer programming to solve power grid blackout problems
- Many-to-many location-routing with inter-hub transport and multi-commodity pickup-and-delivery
- Multiple crossdocks with inventory and time windows
- The two-dimensional bin packing problem with variable bin sizes and costs
- On extending the LP computable risk measures to account downside risk
- Conditional value-at-risk in stochastic programs with mixed-integer recourse
- Accelerating column generation for variable sized bin-packing problems
- MIP: Theory and practice -- closing the gap
- 2-path cuts for the vehicle routing problem with time windows
- The path restoration version of the spare capacity allocation problem with modularity restrictions: models, algorithms, and an empirical analysis
- Complexity of column generation in network design with path-based survivability mechanisms
- The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut
This page was built for software: CPLEX
