XPRESS
From MaRDI portal
Cited in
(only showing first 100 items - show all)- A relax-and-cut algorithm for the set partitioning problem
- Cutting-plane-based algorithms for two branch vertices related spanning tree problems
- Linearization and parallelization schemes for convex mixed-integer nonlinear optimization
- From feasibility to improvement to proof: three phases of solving mixed-integer programs
- Biclique completion problems for multicast network design
- VEHICLE ROUTE OPTIMIZATION FOR RFID INTEGRATED WASTE COLLECTION SYSTEM
- Exercises and case examples on operations research.
- Maximum patterns in datasets
- Order acceptance for motorail transportation with uncertain parameters
- Minimum cut bases in undirected networks
- An overview of MINLP algorithms and their implementation in Muriqui optimizer
- Operational research from Taylorism to terabytes: a research agenda for the analytics age
- Computing strong lower and upper bounds for the integrated multiple-depot vehicle and crew scheduling problem with branch-and-price
- A cutting plane method for knapsack polytope
- Improving branch-and-cut performance by random sampling
- PySP: modeling and solving stochastic programs in Python
- Mixed integer programming: A historical perspective with Xpress-MP
- scientific article; zbMATH DE number 1488101 (Why is no real title available?)
- Polyhedral approximation in mixed-integer convex optimization
- On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study
- QPLIB: a library of quadratic programming instances
- GASUB: finding global optima to discrete location problems by a genetic-like algorithm
- A solution for the aggregate production planning problem in a multi-plant, multi-period and multi-product environment
- MIPLIB 2003
- A computational comparison of compact MILP formulations for the zero forcing number
- A multi-period machine assignment problem
- Computational testing of a separation procedure for the knapsack set with a single continuous variable
- Planning logistics operations in the oil industry
- Computational aspects of infeasibility analysis in mixed integer programming
- A linear optimization-based method for data privacy in statistical tabular data
- Robust optimization approaches for purchase planning with supplier selection under lead time uncertainty
- Integrating combinatorial algorithms into a linear programming solver
- CVaR norm and applications in optimization
- Stochastic short-term hydropower planning with inflow scenario trees
- A metaheuristic for the fixed job scheduling problem under spread time constraints
- Progress in Academic computational integer programming
- Nash equilibria in location games on a network
- How does network topology determine the synchronization threshold in a network of oscillators?
- A shadow-test approach to adaptive item calibration
- Advances in the parallelization of the simplex method
- A Steiner arborescence model for the feeder reconfiguration in electric distribution networks
- Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs
- Numerical methods for large-scale nonlinear optimization
- A simple GAP-canceling algorithm for the generalized maximum flow problem
- Single item lot-sizing with non-decreasing capacities
- An integer programming framework for critical elements detection in graphs
- LPFML: A W3C XML schema for linear and integer programming
- Modeling and solving the angular constrained minimum spanning tree problem
- Computation of multi-facility location Nash equilibria on a network under quantity competition
- 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
- Job-shop scheduling with mixed blocking constraints between operations
- Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique
- An adaptive robust portfolio optimization model with loss constraints based on data-driven polyhedral uncertainty sets
- bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- An LP-based metaheuristic procedure for the k-sequential generalized assignment problem
- An optimization-based approach to assess non-interference in labeled and bounded Petri net systems
- CVaR distance between univariate probability distributions and approximation problems
- Calculation of the Prokhorov distance by optimal quantization and maximum flow
- Optimal Control of Continuous-Time Switched Affine Systems
- Four Good Reasons to Use an Interior Point Solver Within a MIP Solver
- Finding groups with maximum betweenness centrality
- Capacitated Multi-Item Lot-Sizing Problems with Time Windows
- Conflict Analysis for MINLP
- Hybrid MIP-CP techniques to solve a multi-machine assignment and scheduling problem in Xpress-CP
- Random sampling and machine learning to understand good decompositions
- Branching in branch-and-price: A generic scheme
- Optimal design and augmentation of strongly attack-tolerant two-hop clusters in directed networks
- Variants of the \(\varepsilon\)-constraint method for biobjective integer programming problems: application to \(p\)-median-cover problems
- Exact mathematical formulations and metaheuristic algorithms for production cost minimization: a case study of the cable industry
- LS-LIB: a library of tools for solving production planning problems
- OR software
- 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
- Optimising energy procurement for small and medium-sized enterprises
- A robust optimization approach to diet problem with overall glycemic load as objective function
- A biased random-key genetic algorithm for the maximum quasi-clique problem
- Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms
- A first implementation of ParaXpress: combining internal and external parallelization to solve MIPs on supercomputers
- 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
- Vehicle routing problem for fashion supply chains with cross-docking
- Optimizing the Layout of Proportional Symbol Maps: Polyhedra and Computation
- Reformulations in Mathematical Programming: Definitions and Systematics
- In situ column generation for a cutting-stock problem
- Futures market trading for electricity producers and retailers
- On robust clusters of minimum cardinality in networks
- Tight Mip Formulation for Multi-Item Discrete Lot-Sizing Problems
- \(bc\)-\(opt\): A branch-and-cut code for mixed integer programs
- Optimal Order Allocation with Discount Pricing
- A feasible active set method with reoptimization for convex quadratic mixed-integer programming
- Exact and heuristic solutions of a discrete competitive location model with Pareto-Huff customer choice rule
- Network design formulations for scheduling U.S. air force channel route missions
- Accelerating Benders decomposition for short-term hydropower maintenance scheduling
- Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework
- Operations planning with real time pricing of a primary input
- The maximum balanced subgraph of a signed graph: applications and solution approaches
This page was built for software: XPRESS
