The following pages link to (Q4054818):
Displaying 50 items.
- Core-based criterion for extreme supermodular functions (Q277638) (← links)
- Decomposition based hybrid metaheuristics (Q319285) (← links)
- A decompose-and-fix heuristic based on multi-commodity flow models for driver rostering with days-off pattern (Q319599) (← links)
- A branch-cut-and-price algorithm for the piecewise linear transportation problem (Q319653) (← links)
- Surgical scheduling with simultaneous employment of specialised human resources (Q319663) (← links)
- Scheduling pumpoff operations in onshore oilfields under electric-power constraints (Q320129) (← links)
- Large-scale pickup and delivery work area design (Q339655) (← links)
- Construct, Merge, Solve \& Adapt A new general algorithm for combinatorial optimization (Q342297) (← links)
- A variable fixing heuristic with local branching for the fixed charge uncapacitated network design problem with user-optimal flow (Q342561) (← links)
- Two-stage minimax regret robust uncapacitated lot-sizing problems with demand uncertainty (Q408396) (← links)
- Modelling weak disposability in data envelopment analysis under relaxed convexity assumptions (Q418076) (← links)
- On \(n\)-step MIR and partition inequalities for integer knapsack and single-node capacitated flow sets (Q427901) (← links)
- A two-phase method for selecting IMRT treatment beam angles: branch-and-prune and local neighborhood search (Q439437) (← links)
- A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem (Q439503) (← links)
- A reduction approach to the repeated assignment problem (Q531433) (← links)
- Optimization models for targeted offers in direct marketing: exact and heuristic algorithms (Q541729) (← links)
- Lagrangian heuristic for a class of the generalized assignment problems (Q611434) (← links)
- A primogenitary linked quad tree approach for solution storage and retrieval in heuristic binary optimization (Q621968) (← links)
- A note on the MIR closure and basic relaxations of polyhedra (Q635512) (← links)
- Cutting planes in integer and mixed integer programming (Q697578) (← links)
- Convex relaxations for mixed integer predictive control (Q710707) (← links)
- A Lagrangian heuristic for satellite range scheduling with resource constraints (Q716351) (← links)
- Cryptanalysis of a knapsack-based probabilistic encryption scheme (Q730959) (← links)
- A closed-loop logistic model with a spanning-tree based genetic algorithm (Q732907) (← links)
- Improving computational capabilities for addressing volume constraints in forest harvest scheduling problems (Q852995) (← links)
- On separating cover inequalities for the multidimensional knapsack problem (Q858283) (← links)
- Improving the efficiency of the branch and bound algorithm for integer programming based on ``flatness'' information (Q858332) (← links)
- Lower bounds for the two-stage uncapacitated facility location problem (Q864032) (← links)
- Designing cost-effective content distribution networks (Q869005) (← links)
- The \(p/q\)-\texttt{ACTIVE} uncapacitated facility location problem: investigation of the solution space and an LP-fitting heuristic (Q869586) (← links)
- Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem (Q875412) (← links)
- A note on the MIR closure (Q924876) (← links)
- Bounds on the size of branch-and-bound proofs for integer knapsacks (Q924879) (← links)
- The manpower allocation problem with time windows and job-teaming constraints: A branch-and-price approach (Q958447) (← links)
- Solving a cut problem in bipartite graphs by linear programming: application to a forest management problem (Q969344) (← links)
- On the complexity of cutting-plane proofs using split cuts (Q969513) (← links)
- Multiple instance learning via margin maximization (Q972299) (← links)
- Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique (Q976396) (← links)
- Cutting plane algorithms for \(0-1\) programming based on cardinality cuts (Q976440) (← links)
- Scheduling elective surgery under uncertainty and downstream capacity constraints (Q976503) (← links)
- A branch-and-price algorithm for an integrated production and inventory routing problem (Q991383) (← links)
- Block-diagonal semidefinite programming hierarchies for 0/1 programming (Q1002080) (← links)
- Approximation algorithms for group prize-collecting and location-routing problems (Q1003471) (← links)
- Solution approaches for the soft drink integrated production lot sizing and scheduling problem (Q1027560) (← links)
- A note on the virtual crystal approach to alloy optimization (Q1028240) (← links)
- Relax and fix heuristics to solve one-stage one-machine lot-scheduling models for small-scale soft drink plants (Q1040968) (← links)
- On \(BFC-MSMIP\) strategies for scenario cluster partitioning, and twin node family branching selection and bounding for multistage stochastic mixed integer programming (Q1040974) (← links)
- A non-delayed relax-and-cut algorithm for scheduling problems with parallel machines, due dates and sequence-dependent setup times (Q1046712) (← links)
- Cutting-plane theory: Algebraic methods (Q1257827) (← links)
- A number theoretic reformulation and decomposition method for integer programming (Q1394028) (← links)
