scientific article; zbMATH DE number 3470175

Cited in

(97)

Block-diagonal semidefinite programming hierarchies for 0/1 programming
Approximation algorithms for group prize-collecting and location-routing problems
Solution approaches for the soft drink integrated production lot sizing and scheduling problem
A note on the virtual crystal approach to alloy optimization
Relax and fix heuristics to solve one-stage one-machine lot-scheduling models for small-scale soft drink plants
On \(BFC-MSMIP\) strategies for scenario cluster partitioning, and twin node family branching selection and bounding for multistage stochastic mixed integer programming
A non-delayed relax-and-cut algorithm for scheduling problems with parallel machines, due dates and sequence-dependent setup times
Cutting-plane theory: Algebraic methods
A number theoretic reformulation and decomposition method for integer programming
On the convergence of conditional -subgradient methods for convex programs and convex-concave saddle-point problems.
Integer programming, Barvinok's counting algorithm and Gomory relaxations.
Designing communication networks for distributed control agents.
Evolution and state-of-the-art in integer programming
Combinatorial optimization: current successes and directions for the future
Formulating logical implications in combinatorial optimisation
Length-bounded disjoint paths in planar graphs
Robust goal programming using different robustness echelons via norm-based and ellipsoidal uncertainty sets
Green design of wireless local area networks by multiband robust optimization
Facets for continuous multi-mixing set with general coefficients and bounded integer variables
A branch and price algorithm to solve the integrated production planning and scheduling in bulk ports
A column generation approach for the integrated shift and task scheduling problem of logistics assistants in hospitals
Changeover formulations for discrete-time mixed-integer programming scheduling models
Models for the piecewise linear unsplittable multicommodity flow problems
A branch-and-cut-and-price approach for the capacitated \(m\)-ring-star problem
A branch-and-price approach to p-median location problems
Outbound supply chain network design with mode selection, lead times and capacitated vehicle distribution centers
A branch-and-cut algorithm for the pallet loading problem
A parallel optimization approach for controlling allele diversity in conservation schemes
The transportation problem with exclusionary side constraints and two branch-and-bound algorithms
Optimization models for ATM network planning
A column generation approach for solving a non-temporal forest harvest model with spatial structure constraints
Optimizing splitter and fiber location in a multilevel optical FTTH network
A strengthened formulation and cutting planes for the open pit mine production scheduling problem
The minimum flow cost Hamiltonian cycle problem: a comparison of formulations
The effect of strengthened linear formulations on improving the lower bounds for the part families with precedence constraints problem
A pegging approach to the precedence-constrained knapsack problem
A global optimization algorithm for reliable network design
Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs
Two new algorithms for UMTS access network topology design
Preference scheduling for nurses using column generation
Towards using the chordal graph polytope in learning decomposable models
Lot sizing and furnace scheduling in small foundries
Heuristic and exact algorithms for the max-min optimization of the multi-scenario knapsack problem
The multi-item capacitated lot-sizing problem with setup times and shortage costs
Classification of orthogonal arrays by integer programming
Rolling-horizon and fix-and-relax heuristics for the parallel machine lot-sizing and scheduling problem with sequence-dependent set-up costs
Exact solutions to a class of stochastic generalized assignment problems
Modeling of period overlapping setup times
Optimizing a linear function over an integer efficient set
Solving a gas-lift optimization problem by dynamic programming
International trade and biological invasions: a queuing theoretic analysis of the prevention problem
Core-based criterion for extreme supermodular functions
Decomposition based hybrid metaheuristics
A decompose-and-fix heuristic based on multi-commodity flow models for driver rostering with days-off pattern
A branch-cut-and-price algorithm for the piecewise linear transportation problem
Surgical scheduling with simultaneous employment of specialised human resources
Scheduling pumpoff operations in onshore oilfields under electric-power constraints
Large-scale pickup and delivery work area design
Construct, Merge, Solve \& Adapt A new general algorithm for combinatorial optimization
A variable fixing heuristic with local branching for the fixed charge uncapacitated network design problem with user-optimal flow
Two-stage minimax regret robust uncapacitated lot-sizing problems with demand uncertainty
Modelling weak disposability in data envelopment analysis under relaxed convexity assumptions
On \(n\)-step MIR and partition inequalities for integer knapsack and single-node capacitated flow sets
A two-phase method for selecting IMRT treatment beam angles: branch-and-prune and local neighborhood search
A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem
Optimal inference for Simon's two-stage design with over or under enrollment at the second stage
A reduction approach to the repeated assignment problem
Optimization models for targeted offers in direct marketing: exact and heuristic algorithms
A general scheme for automatic generation of search heuristics from specification \(dependencies^{*}\)
Scheduling projects with labor constraints
Algorithm for optimal winner determination in combinatorial auctions
The cable trench problem: Combining the shortest path and minimum spanning tree problems
Lagrangian heuristic for a class of the generalized assignment problems
A primogenitary linked quad tree approach for solution storage and retrieval in heuristic binary optimization
A note on the MIR closure and basic relaxations of polyhedra
Cutting planes in integer and mixed integer programming
Convex relaxations for mixed integer predictive control
A Lagrangian heuristic for satellite range scheduling with resource constraints
Cryptanalysis of a knapsack-based probabilistic encryption scheme
A closed-loop logistic model with a spanning-tree based genetic algorithm
Improving computational capabilities for addressing volume constraints in forest harvest scheduling problems
On separating cover inequalities for the multidimensional knapsack problem
Improving the efficiency of the branch and bound algorithm for integer programming based on ``flatness information
Lower bounds for the two-stage uncapacitated facility location problem
Designing cost-effective content distribution networks
The \(p/q\)-\texttt{ACTIVE} uncapacitated facility location problem: investigation of the solution space and an LP-fitting heuristic
Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem
A note on the MIR closure
Bounds on the size of branch-and-bound proofs for integer knapsacks
The manpower allocation problem with time windows and job-teaming constraints: A branch-and-price approach
Solving a cut problem in bipartite graphs by linear programming: application to a forest management problem
On the complexity of cutting-plane proofs using split cuts
Multiple instance learning via margin maximization
Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique
Cutting plane algorithms for \(0-1\) programming based on cardinality cuts
Scheduling elective surgery under uncertainty and downstream capacity constraints
A branch-and-price algorithm for an integrated production and inventory routing problem

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4054818)