Computational Optimization and Applications
A Polyhedral Study of the Cardinality Constrained Knapsack Problem
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Cutting planes in integer and mixed integer programming
Discrete Applied Mathematics
Generalized Convex Disjunctive Programming: Nonlinear Convex Hull Relaxation
Computational Optimization and Applications
A Framework to Derive Multidimensional Superadditive Lifting Functions and Its Applications
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
A 0--1 LP Model for the Integration and Consolidation of Air Cargo Shipments
Operations Research
Solving Hard Mixed-Integer Programming Problems with Xpress-MP: A MIPLIB 2003 Case Study
INFORMS Journal on Computing
Expert Systems with Applications: An International Journal
Letter to the editor: An efficient linearization technique for mixed 0-1 polynomial problem
Journal of Computational and Applied Mathematics
Fixed-charge transportation on a path: linear programming formulations
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
Transforming mathematical models using declarative reformulation rules
LION'05 Proceedings of the 5th international conference on Learning and Intelligent Optimization
Branch and cut methods for network optimization
Mathematical and Computer Modelling: An International Journal
Operations Research Letters
Flow pack facets of the single node fixed-charge flow polytope
Operations Research Letters
Flow pack facets of the single node fixed-charge flow polytope
Operations Research Letters
Valid inequalities and separation for capacitated economic lot sizing
Operations Research Letters
A polynomial-time solution to Papadimitriou and Steiglitz's 'traps'
Operations Research Letters
Valid inequalities and separation for mixed 0-1 constraints with variable upper bounds
Operations Research Letters
Fixed-Charge Transportation Problem: Facets of the Projection Polyhedron
Operations Research
Relax-and-fix decomposition technique for solving large scale grid-based location problems
Computers and Industrial Engineering
Hi-index | 0.00 |