XPRESS

swMATH4834MaRDI QIDQ16992FDOQ16992

Author name not available (Why is that?)

Described by source

• Parallelization of the FICO Xpress-Optimizer

Cited In (only showing first 100 items - show all)

• Minimum cut bases in undirected networks
• Title not available (Why is that?)
• On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study
• Mixed integer programming: A historical perspective with Xpress-MP
• Computational aspects of infeasibility analysis in mixed integer programming
• Robust optimization approaches for purchase planning with supplier selection under lead time uncertainty
• Single item lot-sizing with non-decreasing capacities
• Lattice based extended formulations for integer linear equality systems
• A co-operative parallel heuristic for mixed zero--one linear programming: Combining simulated annealing with branch and bound
• Robust optimization of internal transports at a parcel sorting center operated by Deutsche Post world net
• An adaptive robust portfolio optimization model with loss constraints based on data-driven polyhedral uncertainty sets
• Finding groups with maximum betweenness centrality
• CVaR distance between univariate probability distributions and approximation problems
• Calculation of the Prokhorov distance by optimal quantization and maximum flow
• OR software
• Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms
• Optimizing the Layout of Proportional Symbol Maps: Polyhedra and Computation
• In situ column generation for a cutting-stock problem
• Tight Mip Formulation for Multi-Item Discrete Lot-Sizing Problems
• A feasible active set method with reoptimization for convex quadratic mixed-integer programming
• On robust clusters of minimum cardinality in networks
• \(bc\)-\(opt\): A branch-and-cut code for mixed integer programs
• On handling indicator constraints in mixed integer programming
• A comparative study of modeling and solution approaches for the coordinated lot-size problem with dynamic demand
• Designing communication networks to decompose network control problems
• Warehouse location with production, inventory, and distribution decisions: a case study in the lube oil industry
• Mixed integer linear programming formulation techniques
• A heuristic approach to minimize the number of saw cycles in small-scale furniture factories
• Supply chain optimization.
• Supply chain disruption management using stochastic mixed integer programming
• Modeling \& solving stochastic programming problems in supply chain management using Xpress-SP
• An LP-based heuristic procedure for the generalized assignment problem with special ordered sets
• Improved handling of uncertainty and robustness in set covering problems
• How much do we ``pay for using default parameters?
• Dynamic knapsack sets and capacitated lot-sizing
• Constraint programming for computing non-stationary \((R, S)\) inventory policies
• Applied integer programming. Modeling and solution.
• Semidefinite programming and constraint programming
• Solving hard mixed-integer programming problems with Xpress-MP: a MIPLIB 2003 case study
• A goal programming model for partner selection decisions in international joint ventures
• Multi-item lot-sizing with joint set-up costs
• Exact and approximate methods for a one-dimensional minimax bin-packing problem
• Polynomial-time identification of robust network flows under uncertain arc failures
• Event-driven model predictive control of timed hybrid Petri nets
• New bounds for the height limit of a vertical slope
• Mathematical model for cyclic scheduling with work-in-process minimization
• Exact solution approaches for integer linear generalized maximum multiplicative programs through the lens of multi-objective optimization
• Enhanced mixed integer programming techniques and routing problems
• Profit maximization and reduction of the cannibalization effect in chain expansion
• The periodic Vehicle routing problem: classification and heuristic
• Parallelizing the dual revised simplex method
• Integer Programming
• An integrated solver for optimization problems
• Computational Integer Programming and Cutting Planes
• Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
• Exercises and case examples on operations research.
• Models and Lagrangian heuristics for a two-level lot-sizing problem with bounded inventory
• VEHICLE ROUTE OPTIMIZATION FOR RFID INTEGRATED WASTE COLLECTION SYSTEM
• A relax-and-cut algorithm for the set partitioning problem
• Shift-and-propagate
• Maximum patterns in datasets
• Order acceptance for motorail transportation with uncertain parameters
• An overview of MINLP algorithms and their implementation in Muriqui optimizer
• Operational research from Taylorism to terabytes: a research agenda for the analytics age
• A cutting plane method for knapsack polytope
• PySP: modeling and solving stochastic programs in Python
• QPLIB: a library of quadratic programming instances
• Improving branch-and-cut performance by random sampling
• GASUB: finding global optima to discrete location problems by a genetic-like algorithm
• MIPLIB 2003
• Computational testing of a separation procedure for the knapsack set with a single continuous variable
• Planning logistics operations in the oil industry
• Integrating combinatorial algorithms into a linear programming solver
• A metaheuristic for the fixed job scheduling problem under spread time constraints
• CVaR norm and applications in optimization
• Numerical methods for large-scale nonlinear optimization
• A Steiner arborescence model for the feeder reconfiguration in electric distribution networks
• Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs
• LPFML: A W3C XML schema for linear and integer programming
• An integer programming framework for critical elements detection in graphs
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems
• Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique
• Optimal Control of Continuous-Time Switched Affine Systems
• Capacitated Multi-Item Lot-Sizing Problems with Time Windows
• Branching in branch-and-price: A generic scheme
• Finding maximum subgraphs with relatively large vertex connectivity
• The \(L\)-shape search method for triobjective integer programming
• A mathematical model and a metaheuristic approach for a memory allocation problem
• Calculation of the critical height of a homogenized reinforced soil wall: A numerical approach
• An algorithmic framework for solving large-scale multistage stochastic mixed 0-1 problems with nonsymmetric scenario trees
• Reformulations in Mathematical Programming: Definitions and Systematics
• Vehicle routing problem for fashion supply chains with cross-docking
• New heuristic algorithms for discrete competitive location problems with binary and partially binary customer behavior
• The integrated lot sizing and cutting stock problem with saw cycle constraints applied to furniture production
• On a fix-and-relax framework for a class of project scheduling problems
• Securing home health care in times of natural disasters
• Relaxations for two-level multi-item lot-sizing problems
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for software: XPRESS