XPRESS
From MaRDI portal
Software:16992
swMATH4834MaRDI QIDQ16992FDOQ16992
Author name not available (Why is that?)
Cited In (only showing first 100 items - show all)
- 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
- Analysis of MILP Techniques for the Pooling Problem
- 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
- Optimizing Information Security Investments with Limited Budget
- 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?)
- Title not available (Why is that?)
- Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines
- Solving planning and design problems in the process industry using mixed integer and global optimization
- Interval uncertainty-based robust optimization for convex and non-convex quadratic programs with applications in network infrastructure planning
- Noncommercial software for mixed-integer linear programming
- Combining the principles of variable neighborhood decomposition search and the Fix\&Optimize heuristic to solve multi-level lot-sizing and scheduling problems
- Title not available (Why is that?)
- Identification of piecewise affine systems via mixed-integer programming.
- Piece-wise linear approximation of functions of two variables
- PolySCIP
- A brief history of linear and mixed-integer programming computation
- Measuring the impact of primal heuristics
- Conflict analysis in mixed integer programming
- Comparison of bundle and classical column generation
- Stochastic integer programming models for reducing wastages and shortages of blood products at hospitals
- An exact approach for maximizing the lifetime of sensor networks with adjustable sensing ranges
- CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization
- Algorithm 966
- Exact identification of critical nodes in sparse networks via new compact formulations
- Solving resource constrained shortest path problems with LP-based methods
- SCIP: solving constraint integer programs
- Mathematical software -- ICMS 2016. 5th international conference, Berlin, Germany, July 11--14, 2016. Proceedings
- FATCOP 2.0: Advanced features in an opportunistic mixed integer programming solver
- Solving a fuel delivery problem by heuristic and exact approaches.
- A tightly integrated modelling and optimisation library: A new framework for rapid algorithm development
- A computational comparison of several models for the exact solution of the capacity and distance constrained plant location problem
- Title not available (Why is that?)
- A heuristic approach for big bucket multi-level production planning problems
- Polyhedral and Lagrangian approaches for lot sizing with production time windows and setup times
- Knapsack problems with setups
- An exact approach to the problem of extracting an embedded network matrix
- Non delayed relax-and-cut algorithms
- The vertex separator problem: algorithms and computations
- A penalty function heuristic for the resource constrained shortest path problem
- Title not available (Why is that?)
- Some heuristic methods for solving \(p\)-median problems with a coverage constraint
- A strengthened formulation for the simple plant location problem with order
- Tactical planning of offshore petroleum production
- MIP: Theory and practice -- closing the gap
- Solving multi-item lot-sizing problems with an MIP solver using classification and reformulation
- Xpress-Mosel. Multi-solver, multi-problem, multi-model, multi-node modeling and problem solving
- A Lagrangian heuristic for capacitated single item lot sizing problems
- A decomposition approach for the general lotsizing and scheduling problem for parallel production lines
- Modelling recruitment training in mathematical human resource planning
- Oil production optimization solved by piecewise linearization in a branch \& price framework
- MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library
- Column generation based heuristic for tactical planning in multi-period vehicle routing
- Reducing ergonomic risks by job rotation scheduling
- Biclique completion problems for multicast network design
- 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
This page was built for software: XPRESS