On characterizing tighter formulations for 0-1 programs

Article Abstract:

Two methods were formulated designed to address the 0-1 program model tightening. The two methods, which are based on increasing and decreasing knapsack constraint coefficients, utilize information derived from original constraint system's cover structures. Both methods are proven highly capable in obtaining formulations that are 0-1 equivalent and tight.

Research and Development in the Physical, Engineering, and Life Sciences, Mathematics, Integer programming, Linear systems

---

On identifying dominant cliques

Article Abstract:

A study on two graph theory-based approaches for identifying dominant cliques with respect to a given set of clique is presented. The first approach identifies all dominant cliques, but the second one outperforms it by reducing the computational effort involved.

Graph theory

---

Using tree search bounds to enhance a genetic algorithm approach to two rectangle packing problems

Article Abstract:

Experiments with two dimensional packing problems to introduce a new way of utilizing bound based information to improve the performance of a genetic algorithm are demonstrated.

Europe, Usage, Evaluation, Algorithms, Data envelopment analysis, Algorithm, Packing for shipment, Packing (Shipments)

Similar abstracts:

• Abstracts: Job-shop scheduling with processing alternatives. An efficient genetic algorithm for job shop scheduling with tardiness objectives
• Abstracts: Nix carb cravings with these feel-good foods. Foods that cure the crankies!. Maximize energy with these super foods
• Abstracts: Perfect proof. You don't have to handle cash to breach money laundering regs. Exactly how far does an English adjudicator's jurisdiction reach?
• Abstracts: Simulated annealing for complex portfolio selection problems. Optimal portfolio selection and dynamic benchmark tracking
• Abstracts: For smaller jobs, a DIY approach can be appropriate. Sparkling achievement

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.