Atamtrk Alper

Alper Atamtrk

Information about the author Alper Atamtrk will soon be added to the site.
Found 19 papers in total
Three-partition flow cover inequalities for constant capacity fixed-charge network flow problems
Three-partition flow cover inequalities for constant capacity fixed-charge network flow problems
2016
Flow cover inequalities are among the most effective valid inequalities for...
Supermodular covering knapsack polytope
Supermodular covering knapsack polytope
2015
The supermodular covering knapsack set is the discrete upper level set of a...
Separation and Extension of Cover Inequalities for Conic Quadratic Knapsack Constraints with Generalized Upper Bounds
Separation and Extension of Cover Inequalities for Conic Quadratic Knapsack Constraints with Generalized Upper Bounds
2013
Motivated by addressing probabilistic 0–1 programs we study the conic quadratic...
A strong conic quadratic reformulation for machine-job assignment with controllable processing times
A strong conic quadratic reformulation for machine-job assignment with controllable processing times
2009
We describe a polynomial-size conic quadratic reformulation for a machine-job...
Parallel machine match-up scheduling with manufacturing cost considerations
Parallel machine match-up scheduling with manufacturing cost considerations
2010
Many scheduling problems in practice involve rescheduling of disrupted schedules. In...
Polymatroids and mean-risk minimization in discrete optimization
Polymatroids and mean-risk minimization in discrete optimization
2008
We study discrete optimization problems with a submodular mean-risk minimization...
The Flow Set with Partial Order
The Flow Set with Partial Order
2008
The flow set with partial order is a mixed–integer set described by a budget on...
Partition inequalities for capacitated survivable network design based on directed p-cycles
Partition inequalities for capacitated survivable network design based on directed p-cycles
2008
We study the design of capacitated survivable networks using directed p-cycles. A...
Two-stage robust network flow and design under demand uncertainty
Two-stage robust network flow and design under demand uncertainty
2007
We describe a two-stage robust optimization approach for solving network flow and...
Lot sizing with inventory bounds and fixed costs: polyhedral study and computation
Lot sizing with inventory bounds and fixed costs: polyhedral study and computation
2005
We investigate the polyhedral structure of the lot-sizing problem with inventory...
Sequence independent lifting for mixed-integer programming
Sequence independent lifting for mixed-integer programming
2004
We show that superadditive lifting functions lead to sequence independent lifting of...
Integer-programming software systems
Integer-programming software systems
2005
Recent developments in integer-programming software systems have tremendously improved...
Cover and pack inequalities for (mixed) integer programming
Cover and pack inequalities for (mixed) integer programming
2005
We review strong inequalities for fundamental knapsack relaxations of (mixed) integer...
A direct cycle-based column-and-cut generation method for capacitated survivable network design
A direct cycle-based column-and-cut generation method for capacitated survivable network design
2004
A network is said to be survivable if it has sufficient capacity for rerouting all of...
Deferred item and vehicle routing within integrated networks
Deferred item and vehicle routing within integrated networks
2003
This paper studies the possible integration of long-haul operations by transportation...
Capacity acquisition, subcontracting, and lot sizing
Capacity acquisition, subcontracting, and lot sizing
2001
The fundamental question encountered in acquiring capacity to meet nonstationary...
Flow pack facets of the single node fixed-charge flow polytope
Flow pack facets of the single node fixed-charge flow polytope
2001
We present a class of facet-defining inequalities for the single node fixed-charge...
A relational modeling system for linear and integer programming
A relational modeling system for linear and integer programming
2000
We discuss an integer linear programming modeling system based on relational algebra....
Conflict graphs in solving integer programming problems
Conflict graphs in solving integer programming problems
2000
We report on the use of conflict graphs in solving integer programs. A conflict graph...
Papers per page: