28,632 results
Search Results
2. Optimal Cycle Selections: An Experimental Assessment of Integer Programming Formulations
3. A Family of Spanning-Tree Formulations for the Maximum Cut Problem
4. Predicting the Solution Time for Optimization Problems Using Machine Learning : Case of Job Shop Scheduling Problem
5. Variable Neighborhood Search Approach for the Bi-criteria Competitive Location and Design Problem with Elastic Demand
6. Propagation and Branching Strategies for Job Shop Scheduling Minimizing the Weighted Energy Consumption
7. Bidirectional Green Waves for Major Road Axes by Adjusting Separate Left-Turn Phases
8. Green Design of Single Frequency Networks by Multiband Robustness and a Hybrid Metaheuristic
9. A Course Timetabling Problem for Classroom Usage Minimization
10. The Constrained-Routing and Spectrum Assignment Problem: Valid Inequalities and Branch-and-Cut Algorithm
11. Finding Minimum Balanced Separators - An Exact Approach
12. The Balanced Maximally Diverse Grouping Problem with Attribute Values and Varying Group Sizes
13. Screening Out Candidates for Predictive Analytics in Maintenance, Repairs, and Overhaul Organizations
14. Solving Irregular Polyomino Tiling Problem Using Simulated Annealing and Integer Programming
15. On the Linear Relaxation of the -cut Problem with Budget Constraints
16. Intelligent System for Generation and Evaluation of e-Learning Tests Using Integer Programming
17. A Comparative Study of Multiple Objectives for Disaster Relief Logistics
18. Operational Plan for the Energy Plants Considering the Fluctuations in the Spot Price of Electricity
19. Combinatorial Reverse Auction to Coordinate Transmission and Generation Assets in Brazil: Conceptual Proposal Based on Integer Programming
20. An Integer Programming Approach to the Irregular Polyomino Tiling Problem
21. On Complexity and Exact Solution of Production Groups Formation Problem
22. A Local Branching MIP Heuristic for a Real-World Curriculum-Based Course Timetabling Problem
23. Assigning Students to Schools for an Internship
24. Approximation Algorithms and an Integer Program for Multi-level Graph Spanners
25. Minimum and Maximum Category Constraints in the Orienteering Problem with Time Windows
26. The Next Release Problem: Complexity, Exact Algorithms and Computations
27. Task Flow Based Spatial Information Network Resource Scheduling
28. Extended Formulations for Column Constrained Orbitopes
29. Kidney Exchange Programs with a Priori Crossmatch Probing
30. Audit Scheduling in Banking Sector
31. Characterization and Approximation of Strong General Dual Feasible Functions
32. Compact MILP Formulations for the p-Center Problem
33. Development of Threshold Algorithms for a Location Problem with Elastic Demand
34. Planning the Cutting of Photographic Color Paper Rolls for Kodak (Australasia) Pty. Ltd.
35. Trim Loss Optimization in Paper Production Using Reinforcement Artificial Bee Colony
36. A Mathematical Model for Reduction of Trim Loss in Cutting Reels at a Make-to-Order Paper Mill.
37. Combinatorial Optimization Approach for Feasible Low-Power and Real-Time Flexible OS Tasks
38. Modelling and Solving the Joint Order Batching and Picker Routing Problem in Inventories
39. A Generalization of the Directed Graph Layering Problem
40. Designing a multi-echelon reverse logistics operation and network: A case study of office paper in Beijing.
41. State Space Reduced Dynamic Programming for the Aircraft Sequencing Problem with Constrained Position Shifting
42. A Mathematical Model for Reduction of Trim Loss in Cutting Reels at a Make-to-Order Paper Mill
43. Adjacency Variables Formulation for the Minimum Linear Arrangement Problem
44. Solving Graph Partitioning Problems Arising in Tagless Cache Management
45. An Integer Programming Formulation for the Maximum k-Subset Intersection Problem
46. Robust Shift Scheduling in Call Centers
47. Maximum Throughput Network Routing Subject to Fair Flow Allocation
48. World Expo Problem and Its Mixed Integer Programming Based Solution
49. Designing Scalable and Effective Decision Support for Mitigating Attacks in Large Enterprise Networks
50. SAT and IP Based Algorithms for Magic Labeling with Applications
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.