CPLEX
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Optimal sizing, scheduling and shift policy of the grinding section of a ceramic tile plant
- The labeled maximum matching problem
- Minimizing makespan in two-stage hybrid cross docking scheduling problem
- A comparative study of decomposition algorithms for stochastic combinatorial optimization
- Optimal configuration of gamma ray machine radiosurgery units: The sphere covering subproblem
- A new formulation for the traveling deliveryman problem
- Efficient computation of \(\ell _1\) uncertainty model from an impulse response set
- The multi-product pipeline scheduling system
- Adaptive discretization of convex multistage stochastic programs
- A ring-mesh topology design problem for optical transport networks
- Sequencing surgical cases in a day-care environment: an exact branch-and-price approach
- Dantzig-Wolfe and block coordinate-descent decomposition in large-scale integrated refinery-planning
- Integrated cellular manufacturing systems design with production planning and dynamic system reconfiguration
- An exact algorithm for the fixed-charge multiple knapsack problem
- A branching scheme for finding cost-minimal round robin tournaments
- A study of the quadratic semi-assignment polytope
- A hybrid algorithm for the unbounded knapsack problem
- Detecting critical nodes in sparse graphs
- Edge-swapping algorithms for the minimum fundamental cycle basis problem
- Risk neutral and risk averse power optimization in electricity networks with dispersed generation
- Evaluating project completion time in project networks with discrete random activity durations
- A decomposition approach for the probabilistic maximal covering location-allocation problem
- Modeling and optimizing of strategic and tactical production planning in the automotive industry under uncertainty
- Application of a real-world university-course timetabling model solved by integer programming
- Linear optimization over permutation groups
- Evaluating ASP and commercial solvers on the CSPLib
- A parametric filtering algorithm for the graph isomorphism problem
- Knapsack feasibility as an absolute value equation solvable by successive linear programming
- New lower bounds based on column generation and constraint programming for the pattern minimization problem
- Lower and upper bounds for a capacitated plant location problem with multicommodity flow
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
- Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem
- Reformulation in mathematical programming: An application to quantum chemistry
- Disjoint congruence classes and a timetabling application
- Path finding approaches and metabolic pathways
- Risk preference modeling with conditional average: An application to portfolio optimization
- Modeling leakage power reduction in VLSI as optimization problems
- On the reformulation of topology optimization problems as linear or convex quadratic mixed 0-1 programs
- Multi-commodity supply network planning in the forest supply chain
- Solution approaches for the soft drink integrated production lot sizing and scheduling problem
- MILP approach to pattern generation in logical analysis of data
- Mathematical solutions for solving periodic railway transportation
- Choosing robust solutions in discrete optimization problems with fuzzy costs
- Decomposition, reformulation, and diving in university course timetabling
- A cross entropy based algorithm for reliability problems
- Three-dimensional bin packing problem with variable bin height
- Optimization of order policies in supply networks
- Optimal oblivious routing under linear and ellipsoidal uncertainty
- Local search intensified: very large-scale variable neighborhood search for the multi-resource generalized assignment problem
- Clique facets of the axial and planar assignment polytopes
- Using a greedy random adaptative search procedure to solve the cover printing problem
- Relax and fix heuristics to solve one-stage one-machine lot-scheduling models for small-scale soft drink plants
- A lead-time based approach for planning rail-truck intermodal transportation of dangerous goods
- Robust placement of sensors in dynamic water distribution systems
- Optimizing glass coating lines: MIP model and valid inequalities
- Solving the prize-collecting rural postman problem
- A location-allocation heuristic for the capacitated multi-facility Weber problem with probabilistic customer locations
- Improving Benders decomposition using a genetic algorithm
- Checking solvability of systems of interval linear equations and inequalities via mixed integer programming
- Optimizing product assortment under customer-driven demand substitution
- Fuzzy optimization for supply chain planning under supply, demand and process uncertainties
- Feasibility pump 2.0
- Solving a minimum-power covering problem with overlap constraint for cellular network design
- Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem
- An exact algorithm for the capacitated facility location problems with single sourcing
- Dynamic stochastic programming for asset-liability management
- The generalized shifting bottleneck procedure
- Introduction to ABACUS -- a branch-and-cut system
- The vertex set of a \(0/1\)-polytope is strongly \(\mathcal P\)-enumerable
- A genetic algorithm for the multidimensional knapsack problem
- Sevast'yanov's algorithm for the flow-shop scheduling problem
- A new subtour elimination constraint for the vehicle routing problem
- Tight linear programming relaxations of uncapacitated p-hub median problems
- Optimal lines for railway systems
- Price-based planning and scheduling of multiproduct orders in symbiotic manufacturing networks
- Strategic financial risk management and operations research
- Heuristic concentration: Two stage solution construction
- Scheduling staff using mixed integer programming
- Estimated stochastic programs with chance constraints
- Accelerating the regularized decomposition method for two stage stochastic linear problems
- ALPS
- BARON
- BPMPD
- Optimal scrap combination for steel production
- cdd
- CDT
- Chronos
- A new approach to integrating mixed integer programming and constraint logic programming
- Cutting planes for integer programs with general integer variables
- Heuristic concentration and tabu search: A head to head comparison
- Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
- Reserve assemblage of critical areas: A zero-one programming approach
- Cyclic and non-cyclic scheduling of 12h shift nurses by network programming
- CSDP
- CsegGraph
- Flexible machine layout design for dynamic and uncertain production environments
- Efficient solution procedure and reduced size formulations for \(p\)-hub location problems
- A capacity allocation problem with integer side constraints
- Integer optimization by local search. A domain-independent approach
- FATCOP
This page was built for software: CPLEX
