Search

Your search keyword '"Integer programming -- Methods"' showing total 24 results

Search Constraints

Start Over You searched for: Descriptor "Integer programming -- Methods" Remove constraint Descriptor: "Integer programming -- Methods" Topic algorithms -- research Remove constraint Topic: algorithms -- research
24 results on '"Integer programming -- Methods"'

Search Results

1. Finding Critical Links for Closeness Centrality

2. Target Cuts from Relaxed Decision Diagrams

Catalog

Books, media, physical & digital resources

3. Exact Approaches for Network Design Problems with Relays

4. Disjunctive Programming for Multiobjective Discrete Optimisation

5. FiberSCIP--A Shared Memory Parallelization of SCIP

6. Numerically safe lower bounds for the capacitated vehicle routing problem

7. Progressive selection method for the coupled lot-sizing and cutting-stock problem

8. A branch-and-bound algorithm for the knapsack problem with conflict graph

9. Convex relaxations for gas expansion planning

10. Risk-averse shortest path interdiction

11. Bilevel knapsack with interdiction constraints

12. Cutting plane algorithm for convex generalized disjunctive programs

13. Solving the pricing problem in a branch-and-price algorithm for graph coloring using zero-suppressed binary decision diagrams

14. A progressive hedging approach for surgery planning under uncertainty

15. Solving a multigroup mixed-integer programming-based constrained discrimination model

16. Complexity and approximation results for the balance optimization subset selection model for causal inference in observational studies

17. Mathematical Programming Formulations and Algorithms for Discrete k-Median Clustering of Time-Series Data

18. An exact algorithm based on Cut-and-Column generation for the capacitated location-routing problem

19. An Outer-Inner approximation for separable Mixed-Integer nonlinear programs

20. Combining lift-and-project and reduce-and-split

21. Separation and extension of cover inequalities for conic quadratic knapsack constraints with generalized upper bounds

22. Branch-and-price guided search for integer programs with an application to the multicommodity fixed-charge network flow problem

23. A generic branch-and-cut algorithm for multiobjective optimization problems: application to the multilabel traveling salesman problem

24. An exact algorithm for the unbounded knapsack problem with minimizing maximum processing time